Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …100100010011100111100 |
3 | 10221010121212221010102111 |
4 | 100021331030202130330 |
5 | 121142143203014322 |
6 | 2210004133503404 |
7 | 143131561210213 |
oct | 20117514423474 |
9 | 3833555833374 |
10 | 1110202001212 |
11 | 39891a0a5557 |
12 | 15b1b84a1b64 |
13 | 808cb5a0895 |
14 | 3ba3c3b007a |
15 | 1dd2b461177 |
hex | 1027d32273c |
1110202001212 has 24 divisors (see below), whose sum is σ = 2012926456800. Its totient is φ = 535138785216.
The previous prime is 1110202001203. The next prime is 1110202001219. The reversal of 1110202001212 is 2121002020111.
It is a super-3 number, since 3×11102020012123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110202001192 and 1110202001201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110202001219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7252512 + ... + 7404007.
It is an arithmetic number, because the mean of its divisors is an integer number (83871935700).
Almost surely, 21110202001212 is an apocalyptic number.
It is an amenable number.
1110202001212 is a deficient number, since it is larger than the sum of its proper divisors (902724455588).
1110202001212 is a wasteful number, since it uses less digits than its factorization.
1110202001212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14657205 (or 14657203 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1110202001212 its reverse (2121002020111), we get a palindrome (3231204021323).
The spelling of 1110202001212 in words is "one trillion, one hundred ten billion, two hundred two million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •