Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …111010111010101111000000 |
3 | 111021001002112010111121101010 |
4 | 112333200131322322233000 |
5 | 101223232220233014331 |
6 | 555022235443040520 |
7 | 30204523620665031 |
oct | 2677403572725700 |
9 | 437032463447333 |
10 | 101121212001216 |
11 | 2a2472a0a4a690 |
12 | b411b75370140 |
13 | 44568c6732a14 |
14 | 1ad8415536a88 |
15 | ba55dc5e7e46 |
hex | 5bf81debabc0 |
101121212001216 has 112 divisors (see below), whose sum is σ = 292096597586688. Its totient is φ = 30619273574400.
The previous prime is 101121212001211. The next prime is 101121212001217. The reversal of 101121212001216 is 612100212121101.
It is a junction number, because it is equal to n+sod(n) for n = 101121212001192 and 101121212001201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121212001211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15620805 + ... + 21124676.
Almost surely, 2101121212001216 is an apocalyptic number.
101121212001216 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
101121212001216 is an abundant number, since it is smaller than the sum of its proper divisors (190975385585472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121212001216 is a wasteful number, since it uses less digits than its factorization.
101121212001216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36746810 (or 36746800 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 21.
Adding to 101121212001216 its reverse (612100212121101), we get a palindrome (713221424122317).
The spelling of 101121212001216 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twelve million, one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •