Base | Representation |
---|---|
bin | 10111101001101110001111… |
… | …000100101011101000011001 |
3 | 111122022102111220021100101010 |
4 | 113221232033010223220121 |
5 | 102113244443101423001 |
6 | 1005123051201044133 |
7 | 30624233263161126 |
oct | 2751561704535031 |
9 | 448272456240333 |
10 | 104022213311001 |
11 | 30165633619107 |
12 | b800250926649 |
13 | 460733902b58b |
14 | 1b989b837b74d |
15 | c05cca9918d6 |
hex | 5e9b8f12ba19 |
104022213311001 has 4 divisors (see below), whose sum is σ = 138696284414672. Its totient is φ = 69348142207332.
The previous prime is 104022213310993. The next prime is 104022213311017. The reversal of 104022213311001 is 100113312220401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 104022213311001 - 23 = 104022213310993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104022223311001) 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, 17337035551831 + ... + 17337035551836.
It is an arithmetic number, because the mean of its divisors is an integer number (34674071103668).
Almost surely, 2104022213311001 is an apocalyptic number.
It is an amenable number.
104022213311001 is a deficient number, since it is larger than the sum of its proper divisors (34674071103671).
104022213311001 is an equidigital number, since it uses as much as digits as its factorization.
104022213311001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34674071103670.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 104022213311001 its reverse (100113312220401), we get a palindrome (204135525531402).
The spelling of 104022213311001 in words is "one hundred four trillion, twenty-two billion, two hundred thirteen million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •