Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …0011001010111011111001 |
3 | 1022110010202012011110202200 |
4 | 2101230122103022323321 |
5 | 2303014044030000441 |
6 | 33143242013020413 |
7 | 2052225640561023 |
oct | 221543223127371 |
9 | 38403665143680 |
10 | 10012010000121 |
11 | 32100846a5958 |
12 | 1158489a84709 |
13 | 5781893b197c |
14 | 2688261d1013 |
15 | 12567e4db7b6 |
hex | 91b1a4caef9 |
10012010000121 has 24 divisors (see below), whose sum is σ = 15506314836480. Its totient is φ = 6202525919616.
The previous prime is 10012010000093. The next prime is 10012010000129. The reversal of 10012010000121 is 12100001021001.
It is a happy number.
It is not a de Polignac number, because 10012010000121 - 27 = 10012009999993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10012010000129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 414152305 + ... + 414176478.
It is an arithmetic number, because the mean of its divisors is an integer number (646096451520).
Almost surely, 210012010000121 is an apocalyptic number.
It is an amenable number.
10012010000121 is a deficient number, since it is larger than the sum of its proper divisors (5494304836359).
10012010000121 is a wasteful number, since it uses less digits than its factorization.
10012010000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828328885 (or 828328882 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10012010000121 its reverse (12100001021001), we get a palindrome (22112011021122).
The spelling of 10012010000121 in words is "ten trillion, twelve billion, ten million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •