Base | Representation |
---|---|
bin | 1001001011111010001110… |
… | …0011011110101110101010 |
3 | 1022202120102010222101121000 |
4 | 2102332203203132232222 |
5 | 2310440213244200020 |
6 | 33251550130055430 |
7 | 2061500446214214 |
oct | 222764343365652 |
9 | 38676363871530 |
10 | 10100212100010 |
11 | 3244526466a8a |
12 | 11715a471a576 |
13 | 5835a489a916 |
14 | 26cbd24015b4 |
15 | 127ae2ac7090 |
hex | 92fa38debaa |
10100212100010 has 64 divisors (see below), whose sum is σ = 28518245942400. Its totient is φ = 2534955192576.
The previous prime is 10100212099979. The next prime is 10100212100023. The reversal of 10100212100010 is 1000121200101.
It is a happy number.
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 = 10100212099965 and 10100212100001.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1100236380 + ... + 1100245559.
It is an arithmetic number, because the mean of its divisors is an integer number (445597592850).
Almost surely, 210100212100010 is an apocalyptic number.
10100212100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100212100010 is an abundant number, since it is smaller than the sum of its proper divisors (18418033842390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100212100010 is a wasteful number, since it uses less digits than its factorization.
10100212100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2200481972 (or 2200481966 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10100212100010 its reverse (1000121200101), we get a palindrome (11100333300111).
The spelling of 10100212100010 in words is "ten trillion, one hundred billion, two hundred twelve million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •