Base | Representation |
---|---|
bin | 1001001100000001101101… |
… | …0111000110100011110010 |
3 | 1022202202121020012001022100 |
4 | 2103000123113012203302 |
5 | 2311003322330334302 |
6 | 33252521411521230 |
7 | 2061601324134261 |
oct | 223003327064362 |
9 | 38682536161270 |
10 | 10102222121202 |
11 | 3245368028722 |
12 | 1171a658b9216 |
13 | 583835143383 |
14 | 26cd433485d8 |
15 | 127bae2b8d1c |
hex | 9301b5c68f2 |
10102222121202 has 72 divisors (see below), whose sum is σ = 23400195137280. Its totient is φ = 3146409413280.
The previous prime is 10102222121149. The next prime is 10102222121209. The reversal of 10102222121202 is 20212122220101.
It is a happy number.
It is a super-2 number, since 2×101022221212022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10102222121209) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 10294302 + ... + 11232857.
It is an arithmetic number, because the mean of its divisors is an integer number (325002710240).
Almost surely, 210102222121202 is an apocalyptic number.
10102222121202 is an abundant number, since it is smaller than the sum of its proper divisors (13297973016078).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102222121202 is a wasteful number, since it uses less digits than its factorization.
10102222121202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21527256 (or 21527224 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10102222121202 its reverse (20212122220101), we get a palindrome (30314344341303).
The spelling of 10102222121202 in words is "ten trillion, one hundred two billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •