Base | Representation |
---|---|
bin | 1010100100000101101011… |
… | …10110111110001001100011 |
3 | 10001020210021222001010210211 |
4 | 11102002311312332021203 |
5 | 11021101004430120303 |
6 | 121223453340034551 |
7 | 4615220600624230 |
oct | 522026566761143 |
9 | 101223258033724 |
10 | 23230234223203 |
11 | 7446983676337 |
12 | 2732212532a57 |
13 | cc67a8ba54b7 |
14 | 5a44c6810787 |
15 | 2a4411ee266d |
hex | 1520b5dbe263 |
23230234223203 has 8 divisors (see below), whose sum is σ = 26548869899360. Its totient is φ = 19911606243840.
The previous prime is 23230234223197. The next prime is 23230234223311. The reversal of 23230234223203 is 30232243203232.
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 23230234223203 - 233 = 23221644288611 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23230234223503) 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, 7860163 + ... + 10403971.
It is an arithmetic number, because the mean of its divisors is an integer number (3318608737420).
Almost surely, 223230234223203 is an apocalyptic number.
23230234223203 is a deficient number, since it is larger than the sum of its proper divisors (3318635676157).
23230234223203 is a wasteful number, since it uses less digits than its factorization.
23230234223203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3848397.
The product of its (nonzero) digits is 62208, while the sum is 31.
Adding to 23230234223203 its reverse (30232243203232), we get a palindrome (53462477426435).
The spelling of 23230234223203 in words is "twenty-three trillion, two hundred thirty billion, two hundred thirty-four million, two hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •