Base | Representation |
---|---|
bin | 1001000111010111101011… |
… | …1110111001011010010001 |
3 | 1022111010002212212022202211 |
4 | 2101311322332321122101 |
5 | 2303201002313310001 |
6 | 33152051211512121 |
7 | 2053040001330415 |
oct | 221657276713221 |
9 | 38433085768684 |
10 | 10022222010001 |
11 | 3214445056043 |
12 | 115a459a58641 |
13 | 579125c9ca76 |
14 | 269114580d45 |
15 | 125a7acc7351 |
hex | 91d7afb9691 |
10022222010001 has 4 divisors (see below), whose sum is σ = 10110914240292. Its totient is φ = 9933529779712.
The previous prime is 10022222009959. The next prime is 10022222010007. The reversal of 10022222010001 is 10001022222001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66524789776 + 9955697220225 = 257924^2 + 3155265^2 .
It is a cyclic number.
It is not a de Polignac number, because 10022222010001 - 29 = 10022222009489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10022222010007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44346114976 + ... + 44346115201.
It is an arithmetic number, because the mean of its divisors is an integer number (2527728560073).
Almost surely, 210022222010001 is an apocalyptic number.
It is an amenable number.
10022222010001 is a deficient number, since it is larger than the sum of its proper divisors (88692230291).
10022222010001 is an equidigital number, since it uses as much as digits as its factorization.
10022222010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88692230290.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10022222010001 its reverse (10001022222001), we get a palindrome (20023244232002).
The spelling of 10022222010001 in words is "ten trillion, twenty-two billion, two hundred twenty-two million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •