Base | Representation |
---|---|
bin | 1010000010000100101010… |
… | …00110001100001110110001 |
3 | 2220010001110121211121012202 |
4 | 11001002111012030032301 |
5 | 10342423324041213101 |
6 | 114530520344032545 |
7 | 4434613245226355 |
oct | 501022506141661 |
9 | 86101417747182 |
10 | 22061453460401 |
11 | 7036234379223 |
12 | 25837a8162755 |
13 | c40503451214 |
14 | 563acc62b465 |
15 | 283d07ebb36b |
hex | 14109518c3b1 |
22061453460401 has 8 divisors (see below), whose sum is σ = 22078759400544. Its totient is φ = 22044150797760.
The previous prime is 22061453460379. The next prime is 22061453460427. The reversal of 22061453460401 is 10406435416022.
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 22061453460401 - 242 = 17663406949297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22061453450401) 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, 12736106 + ... + 14364236.
It is an arithmetic number, because the mean of its divisors is an integer number (2759844925068).
Almost surely, 222061453460401 is an apocalyptic number.
It is an amenable number.
22061453460401 is a deficient number, since it is larger than the sum of its proper divisors (17305940143).
22061453460401 is a wasteful number, since it uses less digits than its factorization.
22061453460401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1638751.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 22061453460401 its reverse (10406435416022), we get a palindrome (32467888876423).
The spelling of 22061453460401 in words is "twenty-two trillion, sixty-one billion, four hundred fifty-three million, four hundred sixty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •