Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …011111010101001001101100 |
3 | 111021001002000202122010000120 |
4 | 112333200102133111021230 |
5 | 101223231322134020022 |
6 | 555022204432324540 |
7 | 30204516101611122 |
oct | 2677402237251154 |
9 | 437032022563016 |
10 | 101121020220012 |
11 | 2a247202770621 |
12 | b411b210a3750 |
13 | 4456895a95610 |
14 | 1ad83d7c93912 |
15 | ba55ca863d5c |
hex | 5bf8127d526c |
101121020220012 has 96 divisors (see below), whose sum is σ = 267633068640000. Its totient is φ = 29458888849152.
The previous prime is 101121020219959. The next prime is 101121020220067. The reversal of 101121020220012 is 210022020121101.
It is a junction number, because it is equal to n+sod(n) for n = 101121020219973 and 101121020220000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5291887 + ... + 15173862.
It is an arithmetic number, because the mean of its divisors is an integer number (2787844465000).
Almost surely, 2101121020220012 is an apocalyptic number.
101121020220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101121020220012 is an abundant number, since it is smaller than the sum of its proper divisors (166512048419988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121020220012 is a wasteful number, since it uses less digits than its factorization.
101121020220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20467455 (or 20467453 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101121020220012 its reverse (210022020121101), we get a palindrome (311143040341113).
The spelling of 101121020220012 in words is "one hundred one trillion, one hundred twenty-one billion, twenty million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •