Base | Representation |
---|---|
bin | 1010100111000011100111… |
… | …00111111011110101110001 |
3 | 10001121112111021210002022002 |
4 | 11103201303213323311301 |
5 | 11024233322230403213 |
6 | 121342355443423345 |
7 | 4625460502262540 |
oct | 523416347736561 |
9 | 101545437702262 |
10 | 23332202200433 |
11 | 74861499668a5 |
12 | 2749b2b384b55 |
13 | 10032a93296b9 |
14 | 5a93dad92157 |
15 | 2a6dcddb6658 |
hex | 1538739fbd71 |
23332202200433 has 8 divisors (see below), whose sum is σ = 26835217090752. Its totient is φ = 19871648096976.
The previous prime is 23332202200403. The next prime is 23332202200513. The reversal of 23332202200433 is 33400220223332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23332202200433 - 222 = 23332198006129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23332202200396 and 23332202200405.
It is not an unprimeable number, because it can be changed into a prime (23332202200403) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10615195535 + ... + 10615197732.
It is an arithmetic number, because the mean of its divisors is an integer number (3354402136344).
Almost surely, 223332202200433 is an apocalyptic number.
It is an amenable number.
23332202200433 is a deficient number, since it is larger than the sum of its proper divisors (3503014890319).
23332202200433 is a wasteful number, since it uses less digits than its factorization.
23332202200433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21230393431.
The product of its (nonzero) digits is 31104, while the sum is 29.
Adding to 23332202200433 its reverse (33400220223332), we get a palindrome (56732422423765).
The spelling of 23332202200433 in words is "twenty-three trillion, three hundred thirty-two billion, two hundred two million, two hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •