Base | Representation |
---|---|
bin | 1010011110000100100000… |
… | …00010111101101000101011 |
3 | 10000112000112012212101222011 |
4 | 11033002100002331220223 |
5 | 11004204001444334121 |
6 | 120544453432140351 |
7 | 4564250224636042 |
oct | 517022002755053 |
9 | 100460465771864 |
10 | 23023441402411 |
11 | 73772064a735a |
12 | 26ba11bb376b7 |
13 | cb014147c348 |
14 | 5984aa503559 |
15 | 29dd5c52a7e1 |
hex | 14f0900bda2b |
23023441402411 has 4 divisors (see below), whose sum is σ = 23124866254632. Its totient is φ = 22922016550192.
The previous prime is 23023441402387. The next prime is 23023441402417. The reversal of 23023441402411 is 11420414432032.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23023441402411 is a prime.
It is a super-2 number, since 2×230234414024112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23023441402417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50712425770 + ... + 50712426223.
It is an arithmetic number, because the mean of its divisors is an integer number (5781216563658).
Almost surely, 223023441402411 is an apocalyptic number.
23023441402411 is a deficient number, since it is larger than the sum of its proper divisors (101424852221).
23023441402411 is a wasteful number, since it uses less digits than its factorization.
23023441402411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101424852220.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 23023441402411 its reverse (11420414432032), we get a palindrome (34443855834443).
The spelling of 23023441402411 in words is "twenty-three trillion, twenty-three billion, four hundred forty-one million, four hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •