Base | Representation |
---|---|
bin | 1010100011100011111011… |
… | …01001001010101110010101 |
3 | 10001012001111221101202022221 |
4 | 11101301331221022232111 |
5 | 11020301400432231123 |
6 | 121211255141022341 |
7 | 4614006516565165 |
oct | 521617551125625 |
9 | 101161457352287 |
10 | 23212111211413 |
11 | 743a223705343 |
12 | 272a7b50b49b1 |
13 | cc4b7b335197 |
14 | 5a36879225a5 |
15 | 2a3c00e3b25d |
hex | 151c7da4ab95 |
23212111211413 has 4 divisors (see below), whose sum is σ = 23265967618368. Its totient is φ = 23158254804460.
The previous prime is 23212111211293. The next prime is 23212111211431. The reversal of 23212111211413 is 31411211121232.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23212111211413 - 29 = 23212111210901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23212111211453) 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, 26928202831 + ... + 26928203692.
It is an arithmetic number, because the mean of its divisors is an integer number (5816491904592).
Almost surely, 223212111211413 is an apocalyptic number.
It is an amenable number.
23212111211413 is a deficient number, since it is larger than the sum of its proper divisors (53856406955).
23212111211413 is an equidigital number, since it uses as much as digits as its factorization.
23212111211413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53856406954.
The product of its digits is 576, while the sum is 25.
Adding to 23212111211413 its reverse (31411211121232), we get a palindrome (54623322332645).
The spelling of 23212111211413 in words is "twenty-three trillion, two hundred twelve billion, one hundred eleven million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •