Base | Representation |
---|---|
bin | 1010011110000100100000… |
… | …01110100011110100101011 |
3 | 10000112000112102120212001202 |
4 | 11033002100032203310223 |
5 | 11004204003234124121 |
6 | 120544454021234415 |
7 | 4564250262530030 |
oct | 517022016436453 |
9 | 100460472525052 |
10 | 23023444442411 |
11 | 7377208193356 |
12 | 26ba120b62a0b |
13 | cb0141ca4c6a |
14 | 5984aaa95387 |
15 | 29dd5c92b40b |
hex | 14f0903a3d2b |
23023444442411 has 8 divisors (see below), whose sum is σ = 26314538480640. Its totient is φ = 19732858040808.
The previous prime is 23023444442407. The next prime is 23023444442521. The reversal of 23023444442411 is 11424444432032.
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 23023444442411 - 22 = 23023444442407 is a prime.
It is a super-4 number, since 4×230234444424114 (a number of 55 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23023444442611) 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, 126811961 + ... + 126993386.
It is an arithmetic number, because the mean of its divisors is an integer number (3289317310080).
Almost surely, 223023444442411 is an apocalyptic number.
23023444442411 is a deficient number, since it is larger than the sum of its proper divisors (3291094038229).
23023444442411 is a wasteful number, since it uses less digits than its factorization.
23023444442411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253818313.
The product of its (nonzero) digits is 294912, while the sum is 38.
Adding to 23023444442411 its reverse (11424444432032), we get a palindrome (34447888874443).
The spelling of 23023444442411 in words is "twenty-three trillion, twenty-three billion, four hundred forty-four million, four hundred forty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •