Base | Representation |
---|---|
bin | 101101011010101011011… |
… | …010001000001101110111 |
3 | 102001100220101112101102100 |
4 | 231122223122020031313 |
5 | 402113323113311411 |
6 | 10345435553113143 |
7 | 441325556241126 |
oct | 55325332101567 |
9 | 12040811471370 |
10 | 3121022010231 |
11 | aa3688618254 |
12 | 424a5bb587b3 |
13 | 19840768c848 |
14 | ab0b5c79abd |
15 | 562b92c7456 |
hex | 2d6ab688377 |
3121022010231 has 12 divisors (see below), whose sum is σ = 4508181294760. Its totient is φ = 2080663621200.
The previous prime is 3121022010209. The next prime is 3121022010259. The reversal of 3121022010231 is 1320102201213.
3121022010231 is a `hidden beast` number, since 3 + 1 + 210 + 220 + 1 + 0 + 231 = 666.
It is not a de Polignac number, because 3121022010231 - 217 = 3121021879159 is a prime.
It is a super-2 number, since 2×31210220102312 (a number of 26 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 (3121026010231) 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 11 ways as a sum of consecutive naturals, for example, 312745 + ... + 2517906.
Almost surely, 23121022010231 is an apocalyptic number.
3121022010231 is a deficient number, since it is larger than the sum of its proper divisors (1387159284529).
3121022010231 is a wasteful number, since it uses less digits than its factorization.
3121022010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2953166 (or 2953163 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 3121022010231 its reverse (1320102201213), we get a palindrome (4441124211444).
The spelling of 3121022010231 in words is "three trillion, one hundred twenty-one billion, twenty-two million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •