Base | Representation |
---|---|
bin | 10110111110000011001001… |
… | …100010101010101100101000 |
3 | 111020200111220000201202002111 |
4 | 112332003021202222230220 |
5 | 101220112013100010440 |
6 | 554504225015412104 |
7 | 30164345565654454 |
oct | 2676031142525450 |
9 | 436614800652074 |
10 | 101021012110120 |
11 | 2a2088527a6433 |
12 | b3b6670684034 |
13 | 444a3186a672b |
14 | 1ad362bb21664 |
15 | ba2bc5a764ea |
hex | 5be0c98aab28 |
101021012110120 has 32 divisors (see below), whose sum is σ = 227298017548800. Its totient is φ = 40408273235008.
The previous prime is 101021012110091. The next prime is 101021012110141. The reversal of 101021012110120 is 21011210120101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 101021012110120.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8824497 + ... + 16730623.
It is an arithmetic number, because the mean of its divisors is an integer number (7103063048400).
Almost surely, 2101021012110120 is an apocalyptic number.
101021012110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021012110120 is an abundant number, since it is smaller than the sum of its proper divisors (126277005438680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021012110120 is a wasteful number, since it uses less digits than its factorization.
101021012110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8225577 (or 8225573 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101021012110120 its reverse (21011210120101), we get a palindrome (122032222230221).
The spelling of 101021012110120 in words is "one hundred one trillion, twenty-one billion, twelve million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •