Base | Representation |
---|---|
bin | 1001010001110110001010… |
… | …0000011100011000001001 |
3 | 1100010022122212012111222121 |
4 | 2110131202200130120021 |
5 | 2314123101200000014 |
6 | 33410454224451241 |
7 | 2102041012110433 |
oct | 224354240343011 |
9 | 40108585174877 |
10 | 10202200000009 |
11 | 3283801a24846 |
12 | 1189308179b21 |
13 | 5900a91a9044 |
14 | 273b0948b653 |
15 | 12a5b15d4124 |
hex | 9476281c609 |
10202200000009 has 8 divisors (see below), whose sum is σ = 10211131243040. Its totient is φ = 10193269132800.
The previous prime is 10202199999991. The next prime is 10202200000021. The reversal of 10202200000009 is 90000000220201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10202200000009 - 217 = 10202199868937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10202199999938 and 10202200000001.
It is not an unprimeable number, because it can be changed into a prime (10202200100009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106523674 + ... + 106619404.
It is an arithmetic number, because the mean of its divisors is an integer number (1276391405380).
Almost surely, 210202200000009 is an apocalyptic number.
It is an amenable number.
10202200000009 is a deficient number, since it is larger than the sum of its proper divisors (8931243031).
10202200000009 is an equidigital number, since it uses as much as digits as its factorization.
10202200000009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187911.
The product of its (nonzero) digits is 72, while the sum is 16.
The spelling of 10202200000009 in words is "ten trillion, two hundred two billion, two hundred million, nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •