Base | Representation |
---|---|
bin | 1001000111010110110111… |
… | …0011110011111001001100 |
3 | 1022111002112110222212001200 |
4 | 2101311231303303321030 |
5 | 2303200024224000022 |
6 | 33152013234505500 |
7 | 2053031345636421 |
oct | 221655563637114 |
9 | 38432473885050 |
10 | 10022001000012 |
11 | 3214341322a61 |
12 | 115a3b7a35290 |
13 | 5790bc26a721 |
14 | 2690d308dd48 |
15 | 125a666bcbac |
hex | 91d6dcf3e4c |
10022001000012 has 144 divisors (see below), whose sum is σ = 25620942477312. Its totient is φ = 3303007868160.
The previous prime is 10022000999993. The next prime is 10022001000043. The reversal of 10022001000012 is 21000010022001.
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 = 10022000999958 and 10022001000003.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 923936773 + ... + 923947619.
It is an arithmetic number, because the mean of its divisors is an integer number (177923211648).
Almost surely, 210022001000012 is an apocalyptic number.
10022001000012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10022001000012 is an abundant number, since it is smaller than the sum of its proper divisors (15598941477300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10022001000012 is a wasteful number, since it uses less digits than its factorization.
10022001000012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11828 (or 11823 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10022001000012 its reverse (21000010022001), we get a palindrome (31022011022013).
The spelling of 10022001000012 in words is "ten trillion, twenty-two billion, one million, twelve", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •