Base | Representation |
---|---|
bin | 1010100111111111010011… |
… | …00001101011100000000011 |
3 | 10001201121012102001011010112 |
4 | 11103333221201223200003 |
5 | 11030244433212340303 |
6 | 121405215213021535 |
7 | 4631003526041321 |
oct | 523775141534003 |
9 | 101647172034115 |
10 | 23364245043203 |
11 | 74987a2249939 |
12 | 27541924848ab |
13 | 10063149b95ac |
14 | 5aab9a848d11 |
15 | 2a7b570170d8 |
hex | 153fe986b803 |
23364245043203 has 8 divisors (see below), whose sum is σ = 24870278581200. Its totient is φ = 21885845148288.
The previous prime is 23364245043151. The next prime is 23364245043239. The reversal of 23364245043203 is 30234054246332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23364245043203 - 222 = 23364240848899 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23364245043283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6908409026 + ... + 6908412407.
It is an arithmetic number, because the mean of its divisors is an integer number (3108784822650).
Almost surely, 223364245043203 is an apocalyptic number.
23364245043203 is a deficient number, since it is larger than the sum of its proper divisors (1506033537997).
23364245043203 is a wasteful number, since it uses less digits than its factorization.
23364245043203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13816821541.
The product of its (nonzero) digits is 1244160, while the sum is 41.
Adding to 23364245043203 its reverse (30234054246332), we get a palindrome (53598299289535).
The spelling of 23364245043203 in words is "twenty-three trillion, three hundred sixty-four billion, two hundred forty-five million, forty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •