Base | Representation |
---|---|
bin | 1010101100000100001110… |
… | …11000100010111100000000 |
3 | 10002012222210100010100012201 |
4 | 11112002013120202330000 |
5 | 11040043333043334212 |
6 | 121553424035202544 |
7 | 4644063160664260 |
oct | 526020730427400 |
9 | 102188710110181 |
10 | 23504332402432 |
11 | 7542149980292 |
12 | 2777369446454 |
13 | 10165ab6b752b |
14 | 5b38898d77a0 |
15 | 2ab605742b57 |
hex | 156087622f00 |
23504332402432 has 36 divisors (see below), whose sum is σ = 53619258297136. Its totient is φ = 10073285314560.
The previous prime is 23504332402429. The next prime is 23504332402433. The reversal of 23504332402432 is 23420423340532.
It is a junction number, because it is equal to n+sod(n) for n = 23504332402391 and 23504332402400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23504332402433) 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 3 ways as a sum of consecutive naturals, for example, 6558126669 + ... + 6558130252.
Almost surely, 223504332402432 is an apocalyptic number.
It is an amenable number.
23504332402432 is an abundant number, since it is smaller than the sum of its proper divisors (30114925894704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23504332402432 is an equidigital number, since it uses as much as digits as its factorization.
23504332402432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13116256944 (or 13116256930 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 37.
Adding to 23504332402432 its reverse (23420423340532), we get a palindrome (46924755742964).
The spelling of 23504332402432 in words is "twenty-three trillion, five hundred four billion, three hundred thirty-two million, four hundred two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •