Base | Representation |
---|---|
bin | 1010100000010011101100… |
… | …00110100100101010111011 |
3 | 10000210100221201010211221002 |
4 | 11100021312012210222323 |
5 | 11011433421240134233 |
6 | 121044045524035215 |
7 | 4602641232300323 |
oct | 520116606445273 |
9 | 100710851124832 |
10 | 23100315552443 |
11 | 73a68749a6058 |
12 | 2710bb4b32b0b |
13 | cb7472b0809c |
14 | 59c0c0076283 |
15 | 2a0d5b3966e8 |
hex | 1502761a4abb |
23100315552443 has 8 divisors (see below), whose sum is σ = 23240095264512. Its totient is φ = 22960553155816.
The previous prime is 23100315552439. The next prime is 23100315552463. The reversal of 23100315552443 is 34425551300132.
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 23100315552443 - 22 = 23100315552439 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23100315552397 and 23100315552406.
It is not an unprimeable number, because it can be changed into a prime (23100315552463) 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, 1647605 + ... + 6993942.
It is an arithmetic number, because the mean of its divisors is an integer number (2905011908064).
Almost surely, 223100315552443 is an apocalyptic number.
23100315552443 is a deficient number, since it is larger than the sum of its proper divisors (139779712069).
23100315552443 is a wasteful number, since it uses less digits than its factorization.
23100315552443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8657721.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 23100315552443 its reverse (34425551300132), we get a palindrome (57525866852575).
The spelling of 23100315552443 in words is "twenty-three trillion, one hundred billion, three hundred fifteen million, five hundred fifty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •