Base | Representation |
---|---|
bin | 1001001100000001101010… |
… | …1001010100101000011101 |
3 | 1022202202120101121100001120 |
4 | 2103000122221110220131 |
5 | 2311003311242321341 |
6 | 33252520302401153 |
7 | 2061601120132062 |
oct | 223003251245035 |
9 | 38682511540046 |
10 | 10102210120221 |
11 | 324536128115a |
12 | 1171a618901b9 |
13 | 583832800abb |
14 | 26cd41902c69 |
15 | 127bad1e8066 |
hex | 9301aa54a1d |
10102210120221 has 16 divisors (see below), whose sum is σ = 13486839510144. Its totient is φ = 6726195500544.
The previous prime is 10102210120213. The next prime is 10102210120243. The reversal of 10102210120221 is 12202101220101.
It is not a de Polignac number, because 10102210120221 - 23 = 10102210120213 is a prime.
It is a super-3 number, since 3×101022101202213 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10102210120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102210127221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23250261 + ... + 23680773.
It is an arithmetic number, because the mean of its divisors is an integer number (842927469384).
Almost surely, 210102210120221 is an apocalyptic number.
It is an amenable number.
10102210120221 is a deficient number, since it is larger than the sum of its proper divisors (3384629389923).
10102210120221 is an equidigital number, since it uses as much as digits as its factorization.
10102210120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 440500.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10102210120221 its reverse (12202101220101), we get a palindrome (22304311340322).
The spelling of 10102210120221 in words is "ten trillion, one hundred two billion, two hundred ten million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •