Base | Representation |
---|---|
bin | 10110110001000111011000… |
… | …111111100110001111110001 |
3 | 111010112112202002122000121020 |
4 | 112301013120333212033301 |
5 | 101111031233024401113 |
6 | 552544034220450053 |
7 | 30043212405140361 |
oct | 2661073077461761 |
9 | 433475662560536 |
10 | 100132213122033 |
11 | 299a5918958684 |
12 | b2923636a9929 |
13 | 43b4572694a31 |
14 | 1aa25d41b29a1 |
15 | b89a06a93023 |
hex | 5b11d8fe63f1 |
100132213122033 has 96 divisors (see below), whose sum is σ = 150737886714240. Its totient is φ = 58944769228800.
The previous prime is 100132213121981. The next prime is 100132213122077. The reversal of 100132213122033 is 330221312231001.
It is not a de Polignac number, because 100132213122033 - 213 = 100132213113841 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100132213121994 and 100132213122012.
It is not an unprimeable number, because it can be changed into a prime (100132213122083) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2265361333 + ... + 2265405533.
It is an arithmetic number, because the mean of its divisors is an integer number (1570186319940).
Almost surely, 2100132213122033 is an apocalyptic number.
It is an amenable number.
100132213122033 is a deficient number, since it is larger than the sum of its proper divisors (50605673592207).
100132213122033 is a wasteful number, since it uses less digits than its factorization.
100132213122033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45587 (or 45570 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 100132213122033 its reverse (330221312231001), we get a palindrome (430353525353034).
The spelling of 100132213122033 in words is "one hundred trillion, one hundred thirty-two billion, two hundred thirteen million, one hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •