Base | Representation |
---|---|
bin | 1010001100101010000010… |
… | …11111101000100101011001 |
3 | 2221101211011101100121201011 |
4 | 11012111001133220211121 |
5 | 10414403123001023103 |
6 | 115405543113453521 |
7 | 4503106311654655 |
oct | 506250137504531 |
9 | 87354141317634 |
10 | 22425123064153 |
11 | 7166494391157 |
12 | 26221804112a1 |
13 | c688ac04a474 |
14 | 57754b72da65 |
15 | 28d4e013cd6d |
hex | 1465417e8959 |
22425123064153 has 4 divisors (see below), whose sum is σ = 22486226942080. Its totient is φ = 22364019186228.
The previous prime is 22425123064121. The next prime is 22425123064181. The reversal of 22425123064153 is 35146032152422.
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 a cyclic number.
It is not a de Polignac number, because 22425123064153 - 25 = 22425123064121 is a prime.
It is a super-2 number, since 2×224251230641532 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22425133064153) 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, 30551938413 + ... + 30551939146.
It is an arithmetic number, because the mean of its divisors is an integer number (5621556735520).
Almost surely, 222425123064153 is an apocalyptic number.
It is an amenable number.
22425123064153 is a deficient number, since it is larger than the sum of its proper divisors (61103877927).
22425123064153 is an equidigital number, since it uses as much as digits as its factorization.
22425123064153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61103877926.
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 22425123064153 in words is "twenty-two trillion, four hundred twenty-five billion, one hundred twenty-three million, sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •