Base | Representation |
---|---|
bin | 10110111101111001111100… |
… | …000011010110100100111100 |
3 | 111020122120100202222020112220 |
4 | 112331321330003112210330 |
5 | 101214431234230333040 |
6 | 554455511402525340 |
7 | 30163545525311136 |
oct | 2675717403264474 |
9 | 436576322866486 |
10 | 101011122121020 |
11 | 2a2046380a0221 |
12 | b3b4770506850 |
13 | 4449400726587 |
14 | 1ad2d70438056 |
15 | ba27e76992d0 |
hex | 5bde7c0d693c |
101011122121020 has 48 divisors (see below), whose sum is σ = 282837091891200. Its totient is φ = 26935732570176.
The previous prime is 101011122121001. The next prime is 101011122121057. The reversal of 101011122121020 is 20121221110101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14828452 + ... + 20540331.
It is an arithmetic number, because the mean of its divisors is an integer number (5892439414400).
Almost surely, 2101011122121020 is an apocalyptic number.
101011122121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101011122121020 is an abundant number, since it is smaller than the sum of its proper divisors (181825969770180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011122121020 is a wasteful number, since it uses less digits than its factorization.
101011122121020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35416394 (or 35416392 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101011122121020 its reverse (20121221110101), we get a palindrome (121132343231121).
The spelling of 101011122121020 in words is "one hundred one trillion, eleven billion, one hundred twenty-two million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •