Base | Representation |
---|---|
bin | 1010100011100001111001… |
… | …00110111111100001110111 |
3 | 10001011221200220022200100111 |
4 | 11101300330212333201313 |
5 | 11020242132122402411 |
6 | 121210555003123451 |
7 | 4613640500514154 |
oct | 521607446774167 |
9 | 101157626280314 |
10 | 23211020122231 |
11 | 7439813826947 |
12 | 272a54b813587 |
13 | cc4a36284396 |
14 | 5a35c2a6322b |
15 | 2a3b8a265721 |
hex | 151c3c9bf877 |
23211020122231 has 8 divisors (see below), whose sum is σ = 23235031647360. Its totient is φ = 23187009410232.
The previous prime is 23211020122207. The next prime is 23211020122237. The reversal of 23211020122231 is 13222102011232.
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 23211020122231 - 221 = 23211018025079 is a prime.
It is a super-2 number, since 2×232110201222312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23211020122237) 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, 69093636 + ... + 69428758.
It is an arithmetic number, because the mean of its divisors is an integer number (2904378955920).
Almost surely, 223211020122231 is an apocalyptic number.
23211020122231 is a deficient number, since it is larger than the sum of its proper divisors (24011525129).
23211020122231 is an equidigital number, since it uses as much as digits as its factorization.
23211020122231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 406565.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 23211020122231 its reverse (13222102011232), we get a palindrome (36433122133463).
The spelling of 23211020122231 in words is "twenty-three trillion, two hundred eleven billion, twenty million, one hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •