Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …1001010011011111101001 |
3 | 1100012000220011210110001202 |
4 | 2110232032021103133221 |
5 | 2314421242133013001 |
6 | 33423015445053545 |
7 | 2103243621442610 |
oct | 224561611233751 |
9 | 40160804713052 |
10 | 10220112001001 |
11 | 3290363872251 |
12 | 11908869b72b5 |
13 | 5919a21083b6 |
14 | 27492832c877 |
15 | 12acadda896b |
hex | 94b8e2537e9 |
10220112001001 has 8 divisors (see below), whose sum is σ = 11680516247424. Its totient is φ = 8759804816160.
The previous prime is 10220112000827. The next prime is 10220112001007. The reversal of 10220112001001 is 10010021102201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10220112001001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220112001007) 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 7 ways as a sum of consecutive naturals, for example, 24039620 + ... + 24461061.
It is an arithmetic number, because the mean of its divisors is an integer number (1460064530928).
Almost surely, 210220112001001 is an apocalyptic number.
It is an amenable number.
10220112001001 is a deficient number, since it is larger than the sum of its proper divisors (1460404246423).
10220112001001 is an equidigital number, since it uses as much as digits as its factorization.
10220112001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48530791.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10220112001001 its reverse (10010021102201), we get a palindrome (20230133103202).
The spelling of 10220112001001 in words is "ten trillion, two hundred twenty billion, one hundred twelve million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •