Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1011011011100001100 |
3 | 100122200221210021002210 |
4 | 1132010021123130030 |
5 | 3123322313441022 |
6 | 114222132350420 |
7 | 10203622662336 |
oct | 1360411333414 |
9 | 318627707083 |
10 | 101001312012 |
11 | 3991a675697 |
12 | 176a9175410 |
13 | 96a80b8b63 |
14 | 4c62030456 |
15 | 29620c9a0c |
hex | 178425b70c |
101001312012 has 24 divisors (see below), whose sum is σ = 235942834176. Its totient is φ = 33628088848.
The previous prime is 101001311981. The next prime is 101001312019. The reversal of 101001312012 is 210213100101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (101001312019) 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 7 ways as a sum of consecutive naturals, for example, 4866108 + ... + 4886819.
It is an arithmetic number, because the mean of its divisors is an integer number (9830951424).
Almost surely, 2101001312012 is an apocalyptic number.
101001312012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101001312012 is an abundant number, since it is smaller than the sum of its proper divisors (134941522164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001312012 is a wasteful number, since it uses less digits than its factorization.
101001312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9753797 (or 9753795 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101001312012 its reverse (210213100101), we get a palindrome (311214412113).
The spelling of 101001312012 in words is "one hundred one billion, one million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •