Base | Representation |
---|---|
bin | 1010001110111001010011… |
… | …00101101001110111100111 |
3 | 2221200011200020221220101001 |
4 | 11013130221211221313213 |
5 | 10422133130014303143 |
6 | 115505142430214131 |
7 | 4511501213021461 |
oct | 507345145516747 |
9 | 87604606856331 |
10 | 22502031400423 |
11 | 719607010a543 |
12 | 2635064954347 |
13 | c72c177b5753 |
14 | 57b165a41131 |
15 | 2904e1ead14d |
hex | 147729969de7 |
22502031400423 has 8 divisors (see below), whose sum is σ = 22734116469792. Its totient is φ = 22269948481536.
The previous prime is 22502031400411. The next prime is 22502031400439. The reversal of 22502031400423 is 32400413020522.
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-22502031400423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22502031400391 and 22502031400400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22502031400493) 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, 28597086 + ... + 29373412.
It is an arithmetic number, because the mean of its divisors is an integer number (2841764558724).
Almost surely, 222502031400423 is an apocalyptic number.
22502031400423 is a deficient number, since it is larger than the sum of its proper divisors (232085069369).
22502031400423 is an equidigital number, since it uses as much as digits as its factorization.
22502031400423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1075241.
The product of its (nonzero) digits is 11520, while the sum is 28.
Adding to 22502031400423 its reverse (32400413020522), we get a palindrome (54902444420945).
The spelling of 22502031400423 in words is "twenty-two trillion, five hundred two billion, thirty-one million, four hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •