Base | Representation |
---|---|
bin | 1010011110010100111001… |
… | …00110101000100011100001 |
3 | 10000112212020112202211002120 |
4 | 11033022130212220203201 |
5 | 11004330012423430213 |
6 | 120552511011534453 |
7 | 4565011266622041 |
oct | 517123446504341 |
9 | 100485215684076 |
10 | 23032242014433 |
11 | 737aa12193433 |
12 | 26bb9772ba429 |
13 | cb0c1482aa92 |
14 | 598aa3255721 |
15 | 29e1c4e6e423 |
hex | 14f29c9a88e1 |
23032242014433 has 32 divisors (see below), whose sum is σ = 31819540919040. Its totient is φ = 14801593605120.
The previous prime is 23032242014387. The next prime is 23032242014477. The reversal of 23032242014433 is 33441024223032.
It is not a de Polignac number, because 23032242014433 - 216 = 23032241948897 is a prime.
It is a super-2 number, since 2×230322420144332 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23032242014394 and 23032242014403.
It is not an unprimeable number, because it can be changed into a prime (23032242014533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 263239053 + ... + 263326533.
It is an arithmetic number, because the mean of its divisors is an integer number (994360653720).
Almost surely, 223032242014433 is an apocalyptic number.
It is an amenable number.
23032242014433 is a deficient number, since it is larger than the sum of its proper divisors (8787298904607).
23032242014433 is a wasteful number, since it uses less digits than its factorization.
23032242014433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92329.
The product of its (nonzero) digits is 82944, while the sum is 33.
Adding to 23032242014433 its reverse (33441024223032), we get a palindrome (56473266237465).
The spelling of 23032242014433 in words is "twenty-three trillion, thirty-two billion, two hundred forty-two million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •