Base | Representation |
---|---|
bin | 1010100100000110000100… |
… | …01010000011111010100001 |
3 | 10001020210211100021211122120 |
4 | 11102003002022003322201 |
5 | 11021101420240213040 |
6 | 121223530030254453 |
7 | 4615225654460166 |
oct | 522030212037241 |
9 | 101223740254576 |
10 | 23230440554145 |
11 | 7446a7a092880 |
12 | 273226b657429 |
13 | cc680c868306 |
14 | 5a4505da006d |
15 | 2a442519c7d0 |
hex | 1520c2283ea1 |
23230440554145 has 64 divisors (see below), whose sum is σ = 43017185652480. Its totient is φ = 10579872972800.
The previous prime is 23230440554143. The next prime is 23230440554177. The reversal of 23230440554145 is 54145504403232.
It is not a de Polignac number, because 23230440554145 - 21 = 23230440554143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23230440554097 and 23230440554106.
It is not an unprimeable number, because it can be changed into a prime (23230440554143) 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 63 ways as a sum of consecutive naturals, for example, 6707616 + ... + 9563105.
It is an arithmetic number, because the mean of its divisors is an integer number (672143525820).
Almost surely, 223230440554145 is an apocalyptic number.
It is an amenable number.
23230440554145 is a deficient number, since it is larger than the sum of its proper divisors (19786745098335).
23230440554145 is a wasteful number, since it uses less digits than its factorization.
23230440554145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16271266.
The product of its (nonzero) digits is 1152000, while the sum is 42.
Adding to 23230440554145 its reverse (54145504403232), we get a palindrome (77375944957377).
The spelling of 23230440554145 in words is "twenty-three trillion, two hundred thirty billion, four hundred forty million, five hundred fifty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •