Base | Representation |
---|---|
bin | 101101001001001011011… |
… | …100011001011011011101 |
3 | 101222120101220001012221210 |
4 | 231021023130121123131 |
5 | 401311332410414401 |
6 | 10333051252415033 |
7 | 440062126652106 |
oct | 55111334313335 |
9 | 11876356035853 |
10 | 3102232123101 |
11 | a96716181a11 |
12 | 421297317479 |
13 | 19670190a437 |
14 | aa2125973ad |
15 | 55a698e34d6 |
hex | 2d24b7196dd |
3102232123101 has 32 divisors (see below), whose sum is σ = 4335632040960. Its totient is φ = 1970739302400.
The previous prime is 3102232123091. The next prime is 3102232123139. The reversal of 3102232123101 is 1013212322013.
It is not a de Polignac number, because 3102232123101 - 213 = 3102232114909 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3102232123141) 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 31 ways as a sum of consecutive naturals, for example, 1217161 + ... + 2772353.
It is an arithmetic number, because the mean of its divisors is an integer number (135488501280).
Almost surely, 23102232123101 is an apocalyptic number.
3102232123101 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3102232123101 is a deficient number, since it is larger than the sum of its proper divisors (1233399917859).
3102232123101 is a wasteful number, since it uses less digits than its factorization.
3102232123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1555557.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3102232123101 its reverse (1013212322013), we get a palindrome (4115444445114).
The spelling of 3102232123101 in words is "three trillion, one hundred two billion, two hundred thirty-two million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •