Base | Representation |
---|---|
bin | 11101001010101111110… |
… | …10000010011101110010 |
3 | 10112210212012021101201020 |
4 | 32211113322002131302 |
5 | 112410002231242320 |
6 | 2044223315320310 |
7 | 132256335150543 |
oct | 16452772023562 |
9 | 3483765241636 |
10 | 1002202212210 |
11 | 357039026591 |
12 | 1422975b0096 |
13 | 736795c30a4 |
14 | 36714adc4ca |
15 | 1b109c6d940 |
hex | e957e82772 |
1002202212210 has 16 divisors (see below), whose sum is σ = 2405285309376. Its totient is φ = 267253923248.
The previous prime is 1002202212199. The next prime is 1002202212211. The reversal of 1002202212210 is 122122022001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1002202212210.
It is not an unprimeable number, because it can be changed into a prime (1002202212211) 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, 16703370174 + ... + 16703370233.
It is an arithmetic number, because the mean of its divisors is an integer number (150330331836).
Almost surely, 21002202212210 is an apocalyptic number.
1002202212210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1002202212210 is an abundant number, since it is smaller than the sum of its proper divisors (1403083097166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002202212210 is a wasteful number, since it uses less digits than its factorization.
1002202212210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33406740417.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1002202212210 its reverse (122122022001), we get a palindrome (1124324234211).
The spelling of 1002202212210 in words is "one trillion, two billion, two hundred two million, two hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •