Base | Representation |
---|---|
bin | 11101011101000001001… |
… | …11110101100010000001 |
3 | 10120202011212022221101010 |
4 | 32232200213311202001 |
5 | 113040100100041001 |
6 | 2052524551431133 |
7 | 133054414006512 |
oct | 16564047654201 |
9 | 3522155287333 |
10 | 1012012112001 |
11 | 3602124aa490 |
12 | 1441749854a9 |
13 | 74580ab1317 |
14 | 36da58d8a09 |
15 | 1b4d10ca8d6 |
hex | eba09f5881 |
1012012112001 has 32 divisors (see below), whose sum is σ = 1500231047040. Its totient is φ = 601696512000.
The previous prime is 1012012111993. The next prime is 1012012112113. The reversal of 1012012112001 is 1002112102101.
It is not a de Polignac number, because 1012012112001 - 23 = 1012012111993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1012012512001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1029520 + ... + 1756113.
It is an arithmetic number, because the mean of its divisors is an integer number (46882220220).
Almost surely, 21012012112001 is an apocalyptic number.
1012012112001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012012112001 is a deficient number, since it is larger than the sum of its proper divisors (488218935039).
1012012112001 is a wasteful number, since it uses less digits than its factorization.
1012012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2785857.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1012012112001 its reverse (1002112102101), we get a palindrome (2014124214102).
It can be divided in two parts, 10120 and 12112001, that added together give a palindrome (12122121).
The spelling of 1012012112001 in words is "one trillion, twelve billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •