Base | Representation |
---|---|
bin | 111110001011010… |
… | …011110100000100 |
3 | 2200200212121201011 |
4 | 332023103310010 |
5 | 4114021332012 |
6 | 251302212004 |
7 | 34564434601 |
oct | 7613236404 |
9 | 2620777634 |
10 | 1043152132 |
11 | 495917700 |
12 | 251424004 |
13 | 1381686a9 |
14 | 9c7816a8 |
15 | 618a71a7 |
hex | 3e2d3d04 |
1043152132 has 18 divisors (see below), whose sum is σ = 2006560094. Its totient is φ = 474159840.
The previous prime is 1043152087. The next prime is 1043152133. The reversal of 1043152132 is 2312513401.
It is a happy number.
1043152132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 783104256 + 260047876 = 27984^2 + 16126^2 .
It is a super-2 number, since 2×10431521322 = 2176332740992290848, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (1043152133) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1077153 + ... + 1078120.
Almost surely, 21043152132 is an apocalyptic number.
It is an amenable number.
1043152132 is a deficient number, since it is larger than the sum of its proper divisors (963407962).
1043152132 is a wasteful number, since it uses less digits than its factorization.
1043152132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2155299 (or 2155286 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 1043152132 is about 32297.8657499222. The cubic root of 1043152132 is about 1014.1819650694.
Adding to 1043152132 its reverse (2312513401), we get a palindrome (3355665533).
The spelling of 1043152132 in words is "one billion, forty-three million, one hundred fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •