Base | Representation |
---|---|
bin | 1001000110001100110001… |
… | …0001011111011000001001 |
3 | 1022102012012022110021100010 |
4 | 2101203030101133120021 |
5 | 2302333310404031441 |
6 | 33134523435102133 |
7 | 2051425430513400 |
oct | 221431421373011 |
9 | 38365168407303 |
10 | 10002111002121 |
11 | 32069649a7177 |
12 | 11565868a1949 |
13 | 57726c5c90c4 |
14 | 268167640637 |
15 | 1252a0430116 |
hex | 918cc45f609 |
10002111002121 has 96 divisors (see below), whose sum is σ = 16990054518528. Its totient is φ = 5197126717440.
The previous prime is 10002111002113. The next prime is 10002111002123. The reversal of 10002111002121 is 12120011120001.
It is not a de Polignac number, because 10002111002121 - 23 = 10002111002113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002111002097 and 10002111002106.
It is not an unprimeable number, because it can be changed into a prime (10002111002123) 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 95 ways as a sum of consecutive naturals, for example, 10079391 + ... + 11027163.
It is an arithmetic number, because the mean of its divisors is an integer number (176979734568).
Almost surely, 210002111002121 is an apocalyptic number.
It is an amenable number.
10002111002121 is a deficient number, since it is larger than the sum of its proper divisors (6987943516407).
10002111002121 is a wasteful number, since it uses less digits than its factorization.
10002111002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947951 (or 947944 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10002111002121 its reverse (12120011120001), we get a palindrome (22122122122122).
The spelling of 10002111002121 in words is "ten trillion, two billion, one hundred eleven million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •