Base | Representation |
---|---|
bin | 1010000000111111010001… |
… | …0111101001111000011010 |
3 | 1102222202011020212020201011 |
4 | 2200033310113221320122 |
5 | 2420410240330134320 |
6 | 35230520034244134 |
7 | 2214412062154462 |
oct | 240176427517032 |
9 | 42882136766634 |
10 | 11012101021210 |
11 | 3566229a3a293 |
12 | 129a27642664a |
13 | 61b58a499133 |
14 | 2a0dba76cba2 |
15 | 1416b3c3205a |
hex | a03f45e9e1a |
11012101021210 has 8 divisors (see below), whose sum is σ = 19821781838196. Its totient is φ = 4404840408480.
The previous prime is 11012101021199. The next prime is 11012101021211. The reversal of 11012101021210 is 1212010121011.
It is a happy number.
11012101021210 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11009860608321 + 2240412889 = 3318111^2 + 47333^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (11012101021211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550605051051 + ... + 550605051070.
Almost surely, 211012101021210 is an apocalyptic number.
11012101021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11012101021210 is a deficient number, since it is larger than the sum of its proper divisors (8809680816986).
11012101021210 is a wasteful number, since it uses less digits than its factorization.
11012101021210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1101210102128.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11012101021210 its reverse (1212010121011), we get a palindrome (12224111142221).
The spelling of 11012101021210 in words is "eleven trillion, twelve billion, one hundred one million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •