Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …110011010100100111110100 |
3 | 111021001002111222202110002002 |
4 | 112333200131303110213310 |
5 | 101223232214230310400 |
6 | 555022235332234432 |
7 | 30204523565033030 |
oct | 2677403563244764 |
9 | 437032458673062 |
10 | 101121210010100 |
11 | 2a24729a90a735 |
12 | b411b7476ba18 |
13 | 44568c61b6647 |
14 | 1ad84151791c0 |
15 | ba55dc352ed5 |
hex | 5bf81dcd49f4 |
101121210010100 has 144 divisors (see below), whose sum is σ = 266945645635200. Its totient is φ = 32476335851520.
The previous prime is 101121210010063. The next prime is 101121210010127. The reversal of 101121210010100 is 1010012121101.
It is a super-2 number, since 2×1011212100101002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 41530337 + ... + 43897736.
It is an arithmetic number, because the mean of its divisors is an integer number (1853789205800).
Almost surely, 2101121210010100 is an apocalyptic number.
101121210010100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101121210010100 is an abundant number, since it is smaller than the sum of its proper divisors (165824435625100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121210010100 is a wasteful number, since it uses less digits than its factorization.
101121210010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85428202 (or 85428195 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101121210010100 its reverse (1010012121101), we get a palindrome (102131222131201).
The spelling of 101121210010100 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred ten million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •