Base | Representation |
---|---|
bin | 10110101111101011000001… |
… | …011001111101100001100100 |
3 | 111010012001202001222111201221 |
4 | 112233223001121331201210 |
5 | 101102420122440212012 |
6 | 552430312505230124 |
7 | 30033101546136022 |
oct | 2657530131754144 |
9 | 433161661874657 |
10 | 100033033132132 |
11 | 29967853390281 |
12 | b2770a4492344 |
13 | 43a80c7a23089 |
14 | 1a9b8a6009712 |
15 | b8714e834507 |
hex | 5afac167d864 |
100033033132132 has 72 divisors (see below), whose sum is σ = 190902525722496. Its totient is φ = 45704279142144.
The previous prime is 100033033132129. The next prime is 100033033132169. The reversal of 100033033132132 is 231231330330001.
It is a super-2 number, since 2×1000330331321322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100033033132097 and 100033033132106.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18615193 + ... + 23379295.
It is an arithmetic number, because the mean of its divisors is an integer number (2651423968368).
Almost surely, 2100033033132132 is an apocalyptic number.
It is an amenable number.
100033033132132 is a deficient number, since it is larger than the sum of its proper divisors (90869492590364).
100033033132132 is a wasteful number, since it uses less digits than its factorization.
100033033132132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4764377 (or 4764332 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 100033033132132 its reverse (231231330330001), we get a palindrome (331264363462133).
The spelling of 100033033132132 in words is "one hundred trillion, thirty-three billion, thirty-three million, one hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •