Base | Representation |
---|---|
bin | 1001010001110101110010… |
… | …0011101111001100011110 |
3 | 1100010022101220102011102012 |
4 | 2110131130203233030132 |
5 | 2314122400122401342 |
6 | 33410440301431222 |
7 | 2102035360611110 |
oct | 224353443571436 |
9 | 40108356364365 |
10 | 10202100200222 |
11 | 328376065a787 |
12 | 118929a86b512 |
13 | 590091605708 |
14 | 273ada10d3b0 |
15 | 12a5a796db82 |
hex | 9475c8ef31e |
10202100200222 has 8 divisors (see below), whose sum is σ = 17489314628976. Its totient is φ = 4372328657232.
The previous prime is 10202100200219. The next prime is 10202100200251. The reversal of 10202100200222 is 22200200120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 728721442873 = 10202100200222 / (1 + 0 + 2 + 0 + 2 + 1 + 0 + 0 + 2 + 0 + 0 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10202100200197 and 10202100200206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 364360721423 + ... + 364360721450.
It is an arithmetic number, because the mean of its divisors is an integer number (2186164328622).
Almost surely, 210202100200222 is an apocalyptic number.
10202100200222 is a deficient number, since it is larger than the sum of its proper divisors (7287214428754).
10202100200222 is an equidigital number, since it uses as much as digits as its factorization.
10202100200222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 728721442882.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 10202100200222 its reverse (22200200120201), we get a palindrome (32402300320423).
The spelling of 10202100200222 in words is "ten trillion, two hundred two billion, one hundred million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •