Base | Representation |
---|---|
bin | 10111000000110101000010… |
… | …100011110000011110100101 |
3 | 111021100202220202122201100010 |
4 | 113000311002203300132211 |
5 | 101231224204334000401 |
6 | 555132054403040433 |
7 | 30214220142514644 |
oct | 2700650243603645 |
9 | 437322822581303 |
10 | 101212021000101 |
11 | 2a2818602985a0 |
12 | b427699070119 |
13 | 4462339038b5b |
14 | 1adc98ba6335b |
15 | ba7b549c7ed6 |
hex | 5c0d428f07a5 |
101212021000101 has 16 divisors (see below), whose sum is σ = 147218323037760. Its totient is φ = 61340269643520.
The previous prime is 101212021000061. The next prime is 101212021000121. The reversal of 101212021000101 is 101000120212101.
It is not a de Polignac number, because 101212021000101 - 227 = 101211886782373 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101212021000121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2782596 + ... + 14497133.
It is an arithmetic number, because the mean of its divisors is an integer number (9201145189860).
Almost surely, 2101212021000101 is an apocalyptic number.
101212021000101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101212021000101 is a deficient number, since it is larger than the sum of its proper divisors (46006302037659).
101212021000101 is a wasteful number, since it uses less digits than its factorization.
101212021000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17457236.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101212021000101 its reverse (101000120212101), we get a palindrome (202212141212202).
The spelling of 101212021000101 in words is "one hundred one trillion, two hundred twelve billion, twenty-one million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •