Base | Representation |
---|---|
bin | 1010100011100010000010… |
… | …10111110000001100001111 |
3 | 10001011221220110122120022222 |
4 | 11101301001113300030033 |
5 | 11020242313100411302 |
6 | 121211010535325555 |
7 | 4613642460544622 |
oct | 521610127601417 |
9 | 101157813576288 |
10 | 23211100013327 |
11 | 7439854933246 |
12 | 272a5725208bb |
13 | cc4a499a7015 |
14 | 5a35cd4dbdb9 |
15 | 2a3b92296da2 |
hex | 151c415f030f |
23211100013327 has 4 divisors (see below), whose sum is σ = 24220278274800. Its totient is φ = 22201921751856.
The previous prime is 23211100013317. The next prime is 23211100013357. The reversal of 23211100013327 is 72331000111232.
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 23211100013327 - 28 = 23211100013071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23211100013296 and 23211100013305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23211100013317) 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, 504589130702 + ... + 504589130747.
It is an arithmetic number, because the mean of its divisors is an integer number (6055069568700).
Almost surely, 223211100013327 is an apocalyptic number.
23211100013327 is a deficient number, since it is larger than the sum of its proper divisors (1009178261473).
23211100013327 is a wasteful number, since it uses less digits than its factorization.
23211100013327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1009178261472.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 23211100013327 its reverse (72331000111232), we get a palindrome (95542100124559).
The spelling of 23211100013327 in words is "twenty-three trillion, two hundred eleven billion, one hundred million, thirteen thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •