Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …100010011000011110101100 |
3 | 111020122122221022212101110111 |
4 | 112331322313202120132230 |
5 | 101214440310222023040 |
6 | 554500154413145404 |
7 | 30163612334141026 |
oct | 2675726742303654 |
9 | 436578838771414 |
10 | 101012120111020 |
11 | 2a204aaa470948 |
12 | b3b49aa78b264 |
13 | 444952c40b8c1 |
14 | 1ad3026bc1016 |
15 | ba28550cedea |
hex | 5bdeb78987ac |
101012120111020 has 48 divisors (see below), whose sum is σ = 212617568858688. Its totient is φ = 40311173560320.
The previous prime is 101012120110987. The next prime is 101012120111041. The reversal of 101012120111020 is 20111021210101.
It is a happy number.
It is a super-2 number, since 2×1010121201110202 (a number of 29 digits) contains 22 as substring.
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, 24144772 + ... + 28017748.
It is an arithmetic number, because the mean of its divisors is an integer number (4429532684556).
Almost surely, 2101012120111020 is an apocalyptic number.
101012120111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101012120111020 is an abundant number, since it is smaller than the sum of its proper divisors (111605448747668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101012120111020 is a wasteful number, since it uses less digits than its factorization.
101012120111020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3876010 (or 3876008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101012120111020 its reverse (20111021210101), we get a palindrome (121123141321121).
The spelling of 101012120111020 in words is "one hundred one trillion, twelve billion, one hundred twenty million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •