Base | Representation |
---|---|
bin | 11101000101101001… |
… | …010010100101100011 |
3 | 2222121200211010022110 |
4 | 131011221102211203 |
5 | 1002431201114021 |
6 | 22203124210403 |
7 | 2153663005134 |
oct | 350551224543 |
9 | 88550733273 |
10 | 31233223011 |
11 | 12278381801 |
12 | 6077b39a03 |
13 | 2c39a1c563 |
14 | 1724145c8b |
15 | c2c028476 |
hex | 745a52963 |
31233223011 has 4 divisors (see below), whose sum is σ = 41644297352. Its totient is φ = 20822148672.
The previous prime is 31233222997. The next prime is 31233223027. The reversal of 31233223011 is 11032233213.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11032233213 = 3 ⋅3677411071.
It is not a de Polignac number, because 31233223011 - 231 = 29085739363 is a prime.
It is a super-2 number, since 2×312332230112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (31233223051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5205537166 + ... + 5205537171.
It is an arithmetic number, because the mean of its divisors is an integer number (10411074338).
Almost surely, 231233223011 is an apocalyptic number.
31233223011 is a deficient number, since it is larger than the sum of its proper divisors (10411074341).
31233223011 is a wasteful number, since it uses less digits than its factorization.
31233223011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10411074340.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 31233223011 its reverse (11032233213), we get a palindrome (42265456224).
The spelling of 31233223011 in words is "thirty-one billion, two hundred thirty-three million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •