Base | Representation |
---|---|
bin | 1010000001100010011000… |
… | …01111001001101101111101 |
3 | 2220001021222010202002101121 |
4 | 11000301030033021231331 |
5 | 10342123132102002303 |
6 | 114514234331510541 |
7 | 4433362233512440 |
oct | 500611417115575 |
9 | 86037863662347 |
10 | 22043051203453 |
11 | 702945081a205 |
12 | 25801112b8451 |
13 | c3b85ca9bc97 |
14 | 562c6460d657 |
15 | 2835cc6559bd |
hex | 140c4c3c9b7d |
22043051203453 has 8 divisors (see below), whose sum is σ = 25192462846208. Its totient is φ = 18893740642704.
The previous prime is 22043051203451. The next prime is 22043051203457. The reversal of 22043051203453 is 35430215034022.
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 22043051203453 - 21 = 22043051203451 is a prime.
It is a super-2 number, since 2×220430512034532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22043051203451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24802626 + ... + 25675987.
It is an arithmetic number, because the mean of its divisors is an integer number (3149057855776).
Almost surely, 222043051203453 is an apocalyptic number.
It is an amenable number.
22043051203453 is a deficient number, since it is larger than the sum of its proper divisors (3149411642755).
22043051203453 is an equidigital number, since it uses as much as digits as its factorization.
22043051203453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50541003.
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 22043051203453 its reverse (35430215034022), we get a palindrome (57473266237475).
The spelling of 22043051203453 in words is "twenty-two trillion, forty-three billion, fifty-one million, two hundred three thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •