Base | Representation |
---|---|
bin | 1010100011010001101010… |
… | …00110001000110001000011 |
3 | 10001011010012110122121112101 |
4 | 11101220311012020301003 |
5 | 11020121304324243321 |
6 | 121202554045211231 |
7 | 4613211504033316 |
oct | 521506506106103 |
9 | 101133173577471 |
10 | 23202304134211 |
11 | 743605088a064 |
12 | 2728918860b17 |
13 | cc3c775c4917 |
14 | 5a2dd725c97d |
15 | 2a3829e8a791 |
hex | 151a35188c43 |
23202304134211 has 4 divisors (see below), whose sum is σ = 23640083457552. Its totient is φ = 22764524810872.
The previous prime is 23202304134209. The next prime is 23202304134227. The reversal of 23202304134211 is 11243140320232.
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 23202304134211 - 21 = 23202304134209 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 23202304134211.
It is not an unprimeable number, because it can be changed into a prime (23202304134011) 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, 218889661591 + ... + 218889661696.
It is an arithmetic number, because the mean of its divisors is an integer number (5910020864388).
Almost surely, 223202304134211 is an apocalyptic number.
23202304134211 is a deficient number, since it is larger than the sum of its proper divisors (437779323341).
23202304134211 is an equidigital number, since it uses as much as digits as its factorization.
23202304134211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437779323340.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 23202304134211 its reverse (11243140320232), we get a palindrome (34445444454443).
The spelling of 23202304134211 in words is "twenty-three trillion, two hundred two billion, three hundred four million, one hundred thirty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •