Base | Representation |
---|---|
bin | 101101001001000100110… |
… | …001001011111001111111 |
3 | 101222120010002022111100111 |
4 | 231021010301023321333 |
5 | 401311120223212343 |
6 | 10333032212210451 |
7 | 440056300026100 |
oct | 55110461137177 |
9 | 11876102274314 |
10 | 3102120132223 |
11 | a96668a40572 |
12 | 421265909a27 |
13 | 1966b4658b48 |
14 | aa2017643a7 |
15 | 55a5eb70c9d |
hex | 2d244c4be7f |
3102120132223 has 12 divisors (see below), whose sum is σ = 3608831389800. Its totient is φ = 2658781307952.
The previous prime is 3102120132203. The next prime is 3102120132269. The reversal of 3102120132223 is 3222310212013.
It is not a de Polignac number, because 3102120132223 - 229 = 3101583261311 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3102120132194 and 3102120132203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3102120132203) 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, 1389948 + ... + 2852401.
It is an arithmetic number, because the mean of its divisors is an integer number (300735949150).
Almost surely, 23102120132223 is an apocalyptic number.
3102120132223 is a deficient number, since it is larger than the sum of its proper divisors (506711257577).
3102120132223 is a wasteful number, since it uses less digits than its factorization.
3102120132223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4257286 (or 4257279 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 3102120132223 its reverse (3222310212013), we get a palindrome (6324430344236).
The spelling of 3102120132223 in words is "three trillion, one hundred two billion, one hundred twenty million, one hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •