Base | Representation |
---|---|
bin | 1100001110101100001… |
… | …1100100100100110011 |
3 | 202002022101000002001211 |
4 | 3003223003210210303 |
5 | 11420242103342321 |
6 | 240304115140551 |
7 | 21115344431440 |
oct | 3035303444463 |
9 | 662271002054 |
10 | 210102012211 |
11 | 81116121523 |
12 | 348768a4757 |
13 | 16a741a5cb0 |
14 | a2519da9c7 |
15 | 56ea2830e1 |
hex | 30eb0e4933 |
210102012211 has 8 divisors (see below), whose sum is σ = 258587092064. Its totient is φ = 166234559040.
The previous prime is 210102012209. The next prime is 210102012223. The reversal of 210102012211 is 112210201012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210102012211 - 21 = 210102012209 is a prime.
It is a super-2 number, since 2×2101020122112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 210102012191 and 210102012200.
It is not an unprimeable number, because it can be changed into a prime (210102012271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1154406570 + ... + 1154406751.
It is an arithmetic number, because the mean of its divisors is an integer number (32323386508).
Almost surely, 2210102012211 is an apocalyptic number.
210102012211 is a deficient number, since it is larger than the sum of its proper divisors (48485079853).
210102012211 is a wasteful number, since it uses less digits than its factorization.
210102012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2308813341.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210102012211 its reverse (112210201012), we get a palindrome (322312213223).
The spelling of 210102012211 in words is "two hundred ten billion, one hundred two million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •