Base | Representation |
---|---|
bin | 101101000111010010111… |
… | …111001111001011101001 |
3 | 101222101012001100100111202 |
4 | 231013102333033023221 |
5 | 401243213032304113 |
6 | 10332114541333545 |
7 | 436661060341034 |
oct | 55072277171351 |
9 | 11871161310452 |
10 | 3100211213033 |
11 | a95879453300 |
12 | 420a125672b5 |
13 | 19646c02166c |
14 | aa0a001801b |
15 | 5599c2a0258 |
hex | 2d1d2fcf2e9 |
3100211213033 has 12 divisors (see below), whose sum is σ = 3555829752384. Its totient is φ = 2695835835000.
The previous prime is 3100211213027. The next prime is 3100211213087. The reversal of 3100211213033 is 3303121120013.
It is not a de Polignac number, because 3100211213033 - 212 = 3100211208937 is a prime.
It is a super-2 number, since 2×31002112130332 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3100211212996 and 3100211213014.
It is not an unprimeable number, because it can be changed into a prime (3100211213003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 556988093 + ... + 556993658.
It is an arithmetic number, because the mean of its divisors is an integer number (296319146032).
Almost surely, 23100211213033 is an apocalyptic number.
It is an amenable number.
3100211213033 is a deficient number, since it is larger than the sum of its proper divisors (455618539351).
3100211213033 is a wasteful number, since it uses less digits than its factorization.
3100211213033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113981796 (or 1113981785 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3100211213033 its reverse (3303121120013), we get a palindrome (6403332333046).
The spelling of 3100211213033 in words is "three trillion, one hundred billion, two hundred eleven million, two hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •