Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101101100111000011010 |
3 | 1022102002100122210111221100 |
4 | 2101202022231230320122 |
5 | 2302324032320214320 |
6 | 33134222344252230 |
7 | 2051356243512243 |
oct | 221421255547032 |
9 | 38362318714840 |
10 | 10001011101210 |
11 | 320645004a358 |
12 | 115631a471076 |
13 | 57712578156c |
14 | 2680a1529cca |
15 | 125238ab8790 |
hex | 9188ab6ce1a |
10001011101210 has 48 divisors (see below), whose sum is σ = 26705402625096. Its totient is φ = 2594856933504.
The previous prime is 10001011101181. The next prime is 10001011101227. The reversal of 10001011101210 is 1210111010001.
It can be written as a sum of positive squares in 4 ways, for example, as 7295719721481 + 2705291379729 = 2701059^2 + 1644777^2 .
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 = 10001011101192 and 10001011101201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1501649989 + ... + 1501656648.
Almost surely, 210001011101210 is an apocalyptic number.
10001011101210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10001011101210 is an abundant number, since it is smaller than the sum of its proper divisors (16704391523886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001011101210 is a wasteful number, since it uses less digits than its factorization.
10001011101210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3003306687 (or 3003306684 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10001011101210 its reverse (1210111010001), we get a palindrome (11211122111211).
The spelling of 10001011101210 in words is "ten trillion, one billion, eleven million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •