Base | Representation |
---|---|
bin | 1001100011001101100110… |
… | …00111001000011001011010 |
3 | 2202100200111202220212022001 |
4 | 10301212303013020121122 |
5 | 10223040223111214320 |
6 | 112355434443351214 |
7 | 4265164560335035 |
oct | 461466307103132 |
9 | 82320452825261 |
10 | 21001100101210 |
11 | 6767575567289 |
12 | 24321a1b2250a |
13 | b9451a467328 |
14 | 52865c82c01c |
15 | 266447ea320a |
hex | 1319b31c865a |
21001100101210 has 8 divisors (see below), whose sum is σ = 37801980182196. Its totient is φ = 8400440040480.
The previous prime is 21001100101199. The next prime is 21001100101283. The reversal of 21001100101210 is 1210100110012.
It can be written as a sum of positive squares in 2 ways, for example, as 20733843154249 + 267256946961 = 4553443^2 + 516969^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×210011001012102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 2100110010121 = 21001100101210 / (2 + 1 + 0 + 0 + 1 + 1 + 0 + 0 + 1 + 0 + 1 + 2 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1050055005051 + ... + 1050055005070.
Almost surely, 221001100101210 is an apocalyptic number.
21001100101210 is a deficient number, since it is larger than the sum of its proper divisors (16800880080986).
21001100101210 is a wasteful number, since it uses less digits than its factorization.
21001100101210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2100110010128.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21001100101210 its reverse (1210100110012), we get a palindrome (22211200211222).
The spelling of 21001100101210 in words is "twenty-one trillion, one billion, one hundred million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •