Base | Representation |
---|---|
bin | 10111001101111011011011… |
… | …011000000001000001001001 |
3 | 111101112211112002100120011211 |
4 | 113031323123120001001021 |
5 | 101341001323122013113 |
6 | 1001101413502253121 |
7 | 30336236216335003 |
oct | 2715733330010111 |
9 | 441484462316154 |
10 | 102112233001033 |
11 | 2a599611517872 |
12 | b5520502871a1 |
13 | 44c91b06c17a8 |
14 | 1b30389273373 |
15 | bc129092eb3d |
hex | 5cdedb601049 |
102112233001033 has 8 divisors (see below), whose sum is σ = 104876425381952. Its totient is φ = 99348272320176.
The previous prime is 102112233001007. The next prime is 102112233001057. The reversal of 102112233001033 is 330100332211201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102112233001033 - 25 = 102112233001001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102112233000995 and 102112233001013.
It is not an unprimeable number, because it can be changed into a prime (102112233001133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57031485 + ... + 58794682.
It is an arithmetic number, because the mean of its divisors is an integer number (13109553172744).
Almost surely, 2102112233001033 is an apocalyptic number.
It is an amenable number.
102112233001033 is a deficient number, since it is larger than the sum of its proper divisors (2764192380919).
102112233001033 is a wasteful number, since it uses less digits than its factorization.
102112233001033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115850031.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 102112233001033 its reverse (330100332211201), we get a palindrome (432212565212234).
The spelling of 102112233001033 in words is "one hundred two trillion, one hundred twelve billion, two hundred thirty-three million, one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •