Base | Representation |
---|---|
bin | 111100010100111… |
… | …001101011100101 |
3 | 2121112110121210101 |
4 | 330110321223211 |
5 | 4033100041401 |
6 | 244233024101 |
7 | 34036545100 |
oct | 7424715345 |
9 | 2545417711 |
10 | 1012112101 |
11 | 47a346890 |
12 | 242b55031 |
13 | 1318bb200 |
14 | 985c1737 |
15 | 5dcc5101 |
hex | 3c539ae5 |
1012112101 has 72 divisors (see below), whose sum is σ = 1429964928. Its totient is φ = 707616000.
The previous prime is 1012112099. The next prime is 1012112141.
1012112101 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1012112101 - 21 = 1012112099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012112141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3734596 + ... + 3734866.
It is an arithmetic number, because the mean of its divisors is an integer number (19860624).
Almost surely, 21012112101 is an apocalyptic number.
1012112101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012112101 is a deficient number, since it is larger than the sum of its proper divisors (417852827).
1012112101 is a wasteful number, since it uses less digits than its factorization.
1012112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 363 (or 343 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 1012112101 is about 31813.7093247549. The cubic root of 1012112101 is about 1004.0211754739.
It can be divided in two parts, 10121 and 12101, that multiplied together give a palindrome (122474221).
The spelling of 1012112101 in words is "one billion, twelve million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •