Base | Representation |
---|---|
bin | 10110110001001000010101… |
… | …101110011011110111010001 |
3 | 111010112122101002220002000002 |
4 | 112301020111232123313101 |
5 | 101111040324400030413 |
6 | 552544323255335345 |
7 | 30043246556554100 |
oct | 2661102556336721 |
9 | 433478332802002 |
10 | 100133232033233 |
11 | 299a62a1018753 |
12 | b2925a8981555 |
13 | 43b46a57c3879 |
14 | 1aa268d644037 |
15 | b89a6625c958 |
hex | 5b1215b9bdd1 |
100133232033233 has 24 divisors (see below), whose sum is σ = 117753913296000. Its totient is φ = 84895748191968.
The previous prime is 100133232033203. The next prime is 100133232033257. The reversal of 100133232033233 is 332330232331001.
It is not a de Polignac number, because 100133232033233 - 224 = 100133215256017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100133232033196 and 100133232033205.
It is not an unprimeable number, because it can be changed into a prime (100133232033203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26947535 + ... + 30437412.
It is an arithmetic number, because the mean of its divisors is an integer number (4906413054000).
Almost surely, 2100133232033233 is an apocalyptic number.
It is an amenable number.
100133232033233 is a deficient number, since it is larger than the sum of its proper divisors (17620681262767).
100133232033233 is a wasteful number, since it uses less digits than its factorization.
100133232033233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57385349 (or 57385342 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 100133232033233 its reverse (332330232331001), we get a palindrome (432463464364234).
The spelling of 100133232033233 in words is "one hundred trillion, one hundred thirty-three billion, two hundred thirty-two million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •