Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …110001110110110010000000 |
3 | 111020200102120011111000011020 |
4 | 112332002103301312302000 |
5 | 101220103141142401422 |
6 | 554503555314545440 |
7 | 30164314334126016 |
oct | 2676022361666200 |
9 | 436612504430136 |
10 | 101020110122112 |
11 | 2a20842a6364a5 |
12 | b3b645a598280 |
13 | 444a20386520c |
14 | 1ad35840088b6 |
15 | ba2b717a595c |
hex | 5be093c76c80 |
101020110122112 has 64 divisors (see below), whose sum is σ = 268647777684000. Its totient is φ = 33634077784064.
The previous prime is 101020110122069. The next prime is 101020110122137. The reversal of 101020110122112 is 211221011020101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 101020110122091 and 101020110122100.
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, 153155862 + ... + 153814037.
Almost surely, 2101020110122112 is an apocalyptic number.
101020110122112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101020110122112 is an abundant number, since it is smaller than the sum of its proper divisors (167627667561888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020110122112 is an equidigital number, since it uses as much as digits as its factorization.
101020110122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306970773 (or 306970761 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101020110122112 its reverse (211221011020101), we get a palindrome (312241121142213).
The spelling of 101020110122112 in words is "one hundred one trillion, twenty billion, one hundred ten million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •