Base | Representation |
---|---|
bin | 10100110111111010… |
… | …110011111100010101 |
3 | 2010212000000101121111 |
4 | 110313322303330111 |
5 | 331400212003334 |
6 | 14144004215021 |
7 | 1422262234456 |
oct | 246772637425 |
9 | 63760011544 |
10 | 22413000469 |
11 | 9561610a92 |
12 | 441609a471 |
13 | 2162595a72 |
14 | 112896b12d |
15 | 8b2a0e064 |
hex | 537eb3f15 |
22413000469 has 2 divisors, whose sum is σ = 22413000470. Its totient is φ = 22413000468.
The previous prime is 22413000439. The next prime is 22413000499. The reversal of 22413000469 is 96400031422.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (22413000439) and next prime (22413000499).
It can be written as a sum of positive squares in only one way, i.e., 15046211569 + 7366788900 = 122663^2 + 85830^2 .
It is a cyclic number.
It is not a de Polignac number, because 22413000469 - 223 = 22404611861 is a prime.
It is a super-2 number, since 2×224130004692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22413000469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22413000439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11206500234 + 11206500235.
It is an arithmetic number, because the mean of its divisors is an integer number (11206500235).
Almost surely, 222413000469 is an apocalyptic number.
It is an amenable number.
22413000469 is a deficient number, since it is larger than the sum of its proper divisors (1).
22413000469 is an equidigital number, since it uses as much as digits as its factorization.
22413000469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 22413000469 in words is "twenty-two billion, four hundred thirteen million, four hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •