Base | Representation |
---|---|
bin | 11101001010101111100… |
… | …01101011100011011100 |
3 | 10112210212001011002020011 |
4 | 32211113301223203130 |
5 | 112410001201134322 |
6 | 2044223200333004 |
7 | 132256310424025 |
oct | 16452761534334 |
9 | 3483761132204 |
10 | 1002200021212 |
11 | 35703786a445 |
12 | 142296914164 |
13 | 73679006a40 |
14 | 367146cbc4c |
15 | 1b109989677 |
hex | e957c6b8dc |
1002200021212 has 48 divisors (see below), whose sum is σ = 1892530967040. Its totient is φ = 461631413952.
The previous prime is 1002200021201. The next prime is 1002200021213. The reversal of 1002200021212 is 2121200022001.
It is a happy number.
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 = 1002200021192 and 1002200021201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002200021213) 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, 94837153 + ... + 94847719.
It is an arithmetic number, because the mean of its divisors is an integer number (39427728480).
Almost surely, 21002200021212 is an apocalyptic number.
It is an amenable number.
1002200021212 is a deficient number, since it is larger than the sum of its proper divisors (890330945828).
1002200021212 is a wasteful number, since it uses less digits than its factorization.
1002200021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14050 (or 14048 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1002200021212 its reverse (2121200022001), we get a palindrome (3123400043213).
The spelling of 1002200021212 in words is "one trillion, two billion, two hundred million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •