Base | Representation |
---|---|
bin | 1001011000111000001010… |
… | …1111111010010100110000 |
3 | 1100112212110121201211220220 |
4 | 2112032002233322110300 |
5 | 2323113001000310112 |
6 | 33542153140133040 |
7 | 2113545364210533 |
oct | 226160257722460 |
9 | 40485417654826 |
10 | 10323000010032 |
11 | 331aa61427276 |
12 | 11a87bb997180 |
13 | 59b5bb04aa08 |
14 | 2798c8b62a1a |
15 | 12d7d191498c |
hex | 96382bfa530 |
10323000010032 has 20 divisors (see below), whose sum is σ = 26667750026040. Its totient is φ = 3441000003328.
The previous prime is 10323000010031. The next prime is 10323000010061. The reversal of 10323000010032 is 23001000032301.
It is a junction number, because it is equal to n+sod(n) for n = 10323000009993 and 10323000010020.
It is not an unprimeable number, because it can be changed into a prime (10323000010031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107531250057 + ... + 107531250152.
It is an arithmetic number, because the mean of its divisors is an integer number (1333387501302).
Almost surely, 210323000010032 is an apocalyptic number.
10323000010032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10323000010032 is an abundant number, since it is smaller than the sum of its proper divisors (16344750016008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10323000010032 is a wasteful number, since it uses less digits than its factorization.
10323000010032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215062500220 (or 215062500214 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10323000010032 its reverse (23001000032301), we get a palindrome (33324000042333).
The spelling of 10323000010032 in words is "ten trillion, three hundred twenty-three billion, ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •