Base | Representation |
---|---|
bin | 1010011110100101011110… |
… | …01010011011001001111011 |
3 | 10000120201012220011001110101 |
4 | 11033102233022123021323 |
5 | 11010001230142234321 |
6 | 121000542145500231 |
7 | 4565445003522541 |
oct | 517225712331173 |
9 | 100521186131411 |
10 | 23041143321211 |
11 | 738376a7a5a14 |
12 | 2701640341677 |
13 | cb1a02a04302 |
14 | 5992a94d9d91 |
15 | 29e546653791 |
hex | 14f4af29b27b |
23041143321211 has 4 divisors (see below), whose sum is σ = 23784406009024. Its totient is φ = 22297880633400.
The previous prime is 23041143321191. The next prime is 23041143321221. The reversal of 23041143321211 is 11212334114032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23041143321211 - 223 = 23041134932603 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 23041143321211.
It is not an unprimeable number, because it can be changed into a prime (23041143321221) 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, 371631343860 + ... + 371631343921.
It is an arithmetic number, because the mean of its divisors is an integer number (5946101502256).
Almost surely, 223041143321211 is an apocalyptic number.
23041143321211 is a deficient number, since it is larger than the sum of its proper divisors (743262687813).
23041143321211 is an equidigital number, since it uses as much as digits as its factorization.
23041143321211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 743262687812.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 23041143321211 its reverse (11212334114032), we get a palindrome (34253477435243).
The spelling of 23041143321211 in words is "twenty-three trillion, forty-one billion, one hundred forty-three million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •