Base | Representation |
---|---|
bin | 1010100110001000000101… |
… | …00110100100000100010001 |
3 | 10001111110222212121021222222 |
4 | 11103010002212210010101 |
5 | 11023222343224310213 |
6 | 121315552201310425 |
7 | 4623246461526026 |
oct | 523040246440421 |
9 | 101443885537888 |
10 | 23300241244433 |
11 | 747363882357a |
12 | 27438ab795415 |
13 | 100028490a90a |
14 | 5a7a4833354d |
15 | 2a615d03d808 |
hex | 1531029a4111 |
23300241244433 has 8 divisors (see below), whose sum is σ = 23505931136160. Its totient is φ = 23095067514400.
The previous prime is 23300241244429. The next prime is 23300241244447. The reversal of 23300241244433 is 33444214200332.
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 23300241244433 - 22 = 23300241244429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23300241244393 and 23300241244402.
It is not an unprimeable number, because it can be changed into a prime (23300241244633) 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, 128949743 + ... + 129130308.
It is an arithmetic number, because the mean of its divisors is an integer number (2938241392020).
Almost surely, 223300241244433 is an apocalyptic number.
It is an amenable number.
23300241244433 is a deficient number, since it is larger than the sum of its proper divisors (205689891727).
23300241244433 is a wasteful number, since it uses less digits than its factorization.
23300241244433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258080847.
The product of its (nonzero) digits is 165888, while the sum is 35.
Adding to 23300241244433 its reverse (33444214200332), we get a palindrome (56744455444765).
The spelling of 23300241244433 in words is "twenty-three trillion, three hundred billion, two hundred forty-one million, two hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •