Base | Representation |
---|---|
bin | 111110001101011… |
… | …100100010100001 |
3 | 2200201221001220222 |
4 | 332031130202201 |
5 | 4114142242121 |
6 | 251322212425 |
7 | 34602256412 |
oct | 7615344241 |
9 | 2621831828 |
10 | 1043712161 |
11 | 49616a438 |
12 | 251654115 |
13 | 13830357b |
14 | 9c889809 |
15 | 619680ab |
hex | 3e35c8a1 |
1043712161 has 16 divisors (see below), whose sum is σ = 1165104000. Its totient is φ = 929150208.
The previous prime is 1043712149. The next prime is 1043712191. The reversal of 1043712161 is 1612173401.
1043712161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1043712161 - 26 = 1043712097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1043712161.
It is not an unprimeable number, because it can be changed into a prime (1043712191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237815 + ... + 242163.
It is an arithmetic number, because the mean of its divisors is an integer number (72819000).
Almost surely, 21043712161 is an apocalyptic number.
It is an amenable number.
1043712161 is a deficient number, since it is larger than the sum of its proper divisors (121391839).
1043712161 is a wasteful number, since it uses less digits than its factorization.
1043712161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5128.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 1043712161 is about 32306.5343390466. The cubic root of 1043712161 is about 1014.3634246040.
Adding to 1043712161 its reverse (1612173401), we get a palindrome (2655885562).
The spelling of 1043712161 in words is "one billion, forty-three million, seven hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •