Base | Representation |
---|---|
bin | 10111011110001100011011… |
… | …100111001101100010000000 |
3 | 111112111200200100100100022021 |
4 | 113132030123213031202000 |
5 | 102012310021032120412 |
6 | 1003315113000051224 |
7 | 30513056455062043 |
oct | 2736143347154200 |
9 | 445450610310267 |
10 | 103230002223232 |
11 | 2a98a664066465 |
12 | b6b27baa63b14 |
13 | 457a716958011 |
14 | 1b6c504652c5a |
15 | be03b13a0607 |
hex | 5de31b9cd880 |
103230002223232 has 64 divisors (see below), whose sum is σ = 206108402048640. Its totient is φ = 51500850273280.
The previous prime is 103230002223211. The next prime is 103230002223277. The reversal of 103230002223232 is 232322200032301.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 103230002223197 and 103230002223206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 981529113 + ... + 981634279.
It is an arithmetic number, because the mean of its divisors is an integer number (3220443782010).
Almost surely, 2103230002223232 is an apocalyptic number.
It is an amenable number.
103230002223232 is a deficient number, since it is larger than the sum of its proper divisors (102878399825408).
103230002223232 is a wasteful number, since it uses less digits than its factorization.
103230002223232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122069 (or 122057 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 103230002223232 its reverse (232322200032301), we get a palindrome (335552202255533).
The spelling of 103230002223232 in words is "one hundred three trillion, two hundred thirty billion, two million, two hundred twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •