Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …00000110001010001111001 |
3 | 2221022210201200022112220202 |
4 | 11012001120200301101321 |
5 | 10414031430301321101 |
6 | 115352134334331545 |
7 | 4501431600204122 |
oct | 506013040612171 |
9 | 87283650275822 |
10 | 22404034401401 |
11 | 7158552390754 |
12 | 261a075959bb5 |
13 | c668cac612b3 |
14 | 57650aa1b049 |
15 | 28cba8a2a36b |
hex | 146058831479 |
22404034401401 has 8 divisors (see below), whose sum is σ = 23879017580544. Its totient is φ = 20946506644800.
The previous prime is 22404034401391. The next prime is 22404034401439. The reversal of 22404034401401 is 10410443040422.
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 22404034401401 - 214 = 22404034385017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22404034401481) 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, 4363852985 + ... + 4363858118.
It is an arithmetic number, because the mean of its divisors is an integer number (2984877197568).
Almost surely, 222404034401401 is an apocalyptic number.
It is an amenable number.
22404034401401 is a deficient number, since it is larger than the sum of its proper divisors (1474983179143).
22404034401401 is a wasteful number, since it uses less digits than its factorization.
22404034401401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8727711271.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 22404034401401 its reverse (10410443040422), we get a palindrome (32814477441823).
The spelling of 22404034401401 in words is "twenty-two trillion, four hundred four billion, thirty-four million, four hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •