Base | Representation |
---|---|
bin | 11101101011111010101… |
… | …01011011110010101100 |
3 | 10121111211020210202121100 |
4 | 32311331111123302230 |
5 | 113202440031120022 |
6 | 2100330334403100 |
7 | 133456541054544 |
oct | 16657525336254 |
9 | 3544736722540 |
10 | 1020010020012 |
11 | 363647079115 |
12 | 145827360490 |
13 | 75256a71179 |
14 | 37523bba324 |
15 | 1b7ed3111ac |
hex | ed7d55bcac |
1020010020012 has 18 divisors (see below), whose sum is σ = 2578358661788. Its totient is φ = 340003339992.
The previous prime is 1020010019999. The next prime is 1020010020017. The reversal of 1020010020012 is 2100200100201.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1020010019976 and 1020010020003.
It is not an unprimeable number, because it can be changed into a prime (1020010020017) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14166805798 + ... + 14166805869.
Almost surely, 21020010020012 is an apocalyptic number.
1020010020012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1020010020012 is an abundant number, since it is smaller than the sum of its proper divisors (1558348641776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020010020012 is a wasteful number, since it uses less digits than its factorization.
1020010020012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28333611677 (or 28333611672 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1020010020012 its reverse (2100200100201), we get a palindrome (3120210120213).
The spelling of 1020010020012 in words is "one trillion, twenty billion, ten million, twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •