Base | Representation |
---|---|
bin | 1010100011110100100010… |
… | …11011100000111001011011 |
3 | 10001012220112201112012220020 |
4 | 11101322101123200321123 |
5 | 11020423133434024011 |
6 | 121215332332201523 |
7 | 4614443563514502 |
oct | 521722133407133 |
9 | 101186481465806 |
10 | 23221033111131 |
11 | 7442a91902689 |
12 | 27304850092a3 |
13 | cc597086b99b |
14 | 5a3c92807839 |
15 | 2a407433c006 |
hex | 151e916e0e5b |
23221033111131 has 24 divisors (see below), whose sum is σ = 31446642654720. Its totient is φ = 15239357707392.
The previous prime is 23221033111121. The next prime is 23221033111147. The reversal of 23221033111131 is 13111133012232.
It is not a de Polignac number, because 23221033111131 - 221 = 23221031013979 is a prime.
It is a super-2 number, since 2×232210331111312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23221033111121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26484490 + ... + 27347216.
It is an arithmetic number, because the mean of its divisors is an integer number (1310276777280).
Almost surely, 223221033111131 is an apocalyptic number.
23221033111131 is a deficient number, since it is larger than the sum of its proper divisors (8225609543589).
23221033111131 is an frugal number, since it uses more digits than its factorization.
23221033111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 863483 (or 863146 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 23221033111131 its reverse (13111133012232), we get a palindrome (36332166123363).
The spelling of 23221033111131 in words is "twenty-three trillion, two hundred twenty-one billion, thirty-three million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •