Base | Representation |
---|---|
bin | 1010011101101100000100… |
… | …01010001001000100110011 |
3 | 10000110202200000012222200012 |
4 | 11032312002022021010303 |
5 | 11004000120304020423 |
6 | 120534444030045135 |
7 | 4563304160421422 |
oct | 516660212110463 |
9 | 100422600188605 |
10 | 23010323501363 |
11 | 7371694814120 |
12 | 26b767a9497ab |
13 | cabb30839c13 |
14 | 5979c42472b9 |
15 | 29d840a8a078 |
hex | 14ed82289133 |
23010323501363 has 8 divisors (see below), whose sum is σ = 25214736884736. Its totient is φ = 20824671083400.
The previous prime is 23010323501357. The next prime is 23010323501423. The reversal of 23010323501363 is 36310532301032.
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 23010323501363 - 220 = 23010322452787 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23010323501323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4690238783 + ... + 4690243688.
It is an arithmetic number, because the mean of its divisors is an integer number (3151842110592).
Almost surely, 223010323501363 is an apocalyptic number.
23010323501363 is a deficient number, since it is larger than the sum of its proper divisors (2204413383373).
23010323501363 is a wasteful number, since it uses less digits than its factorization.
23010323501363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9380482705.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 23010323501363 its reverse (36310532301032), we get a palindrome (59320855802395).
The spelling of 23010323501363 in words is "twenty-three trillion, ten billion, three hundred twenty-three million, five hundred one thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •