Base | Representation |
---|---|
bin | 1001001011111010001110… |
… | …0011000110110100110110 |
3 | 1022202120102010210102021210 |
4 | 2102332203203012310312 |
5 | 2310440213233031402 |
6 | 33251550124022250 |
7 | 2061500445325605 |
oct | 222764343066466 |
9 | 38676363712253 |
10 | 10100212002102 |
11 | 32445263aa472 |
12 | 11715a4691986 |
13 | 5835a48651a1 |
14 | 26cbd23b7a3c |
15 | 127ae2aa806c |
hex | 92fa38c6d36 |
10100212002102 has 8 divisors (see below), whose sum is σ = 20200424004216. Its totient is φ = 3366737334032.
The previous prime is 10100212002079. The next prime is 10100212002109. The reversal of 10100212002102 is 20120021200101.
It is a sphenic number, since it is the product of 3 distinct primes.
10100212002102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100212002109) 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 3 ways as a sum of consecutive naturals, for example, 841684333503 + ... + 841684333514.
It is an arithmetic number, because the mean of its divisors is an integer number (2525053000527).
Almost surely, 210100212002102 is an apocalyptic number.
10100212002102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100212002102 is a wasteful number, since it uses less digits than its factorization.
10100212002102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1683368667022.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10100212002102 its reverse (20120021200101), we get a palindrome (30220233202203).
The spelling of 10100212002102 in words is "ten trillion, one hundred billion, two hundred twelve million, two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •