Base | Representation |
---|---|
bin | 1010011110100101111111… |
… | …01010011010101001101011 |
3 | 10000120201221012001001212001 |
4 | 11033102333222122221223 |
5 | 11010002312024040321 |
6 | 121001025435031431 |
7 | 4565454604466011 |
oct | 517227752325153 |
9 | 100521835031761 |
10 | 23041420143211 |
11 | 73838a1a89428 |
12 | 27016b8b9b577 |
13 | cb1a48178302 |
14 | 5992d41988b1 |
15 | 29e560ad4c91 |
hex | 14f4bfa9aa6b |
23041420143211 has 8 divisors (see below), whose sum is σ = 24857114739264. Its totient is φ = 21276871873920.
The previous prime is 23041420143179. The next prime is 23041420143299. The reversal of 23041420143211 is 11234102414032.
It is a happy number.
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 23041420143211 - 25 = 23041420143179 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23041420143211.
It is not an unprimeable number, because it can be changed into a prime (23041420153211) 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, 12786580755 + ... + 12786582556.
It is an arithmetic number, because the mean of its divisors is an integer number (3107139342408).
Almost surely, 223041420143211 is an apocalyptic number.
23041420143211 is a deficient number, since it is larger than the sum of its proper divisors (1815694596053).
23041420143211 is a wasteful number, since it uses less digits than its factorization.
23041420143211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25573163381.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 23041420143211 its reverse (11234102414032), we get a palindrome (34275522557243).
The spelling of 23041420143211 in words is "twenty-three trillion, forty-one billion, four hundred twenty million, one hundred forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •