Base | Representation |
---|---|
bin | 10111000000111101100000… |
… | …011011111011110000010010 |
3 | 111021101122101100100112101021 |
4 | 113000331200123323300102 |
5 | 101231401314210401320 |
6 | 555140200443030054 |
7 | 30214661343450352 |
oct | 2700754033736022 |
9 | 437348340315337 |
10 | 101221112200210 |
11 | 2a2856a600a812 |
12 | b4293b580b32a |
13 | 446315766b3c2 |
14 | 1add1b1218b62 |
15 | ba7ed7bbbdaa |
hex | 5c0f606fbc12 |
101221112200210 has 32 divisors (see below), whose sum is σ = 185359603478400. Its totient is φ = 39786411208320.
The previous prime is 101221112200207. The next prime is 101221112200211. The reversal of 101221112200210 is 12002211122101.
It is not an unprimeable number, because it can be changed into a prime (101221112200211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32539030 + ... + 35513809.
It is an arithmetic number, because the mean of its divisors is an integer number (5792487608700).
Almost surely, 2101221112200210 is an apocalyptic number.
101221112200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101221112200210 is a deficient number, since it is larger than the sum of its proper divisors (84138491278190).
101221112200210 is a wasteful number, since it uses less digits than its factorization.
101221112200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68055426.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101221112200210 its reverse (12002211122101), we get a palindrome (113223323322311).
It can be divided in two parts, 10122111 and 2200210, that added together give a palindrome (12322321).
The spelling of 101221112200210 in words is "one hundred one trillion, two hundred twenty-one billion, one hundred twelve million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •