Base | Representation |
---|---|
bin | 11101000110110111100… |
… | …11011010100101011100 |
3 | 10112121111002102012101002 |
4 | 32203123303122211130 |
5 | 112341221221214322 |
6 | 2043240540405432 |
7 | 132153623411231 |
oct | 16433363324534 |
9 | 3477432365332 |
10 | 1000120101212 |
11 | 35616a7a67a1 |
12 | 1419b6246878 |
13 | 7340712984b |
14 | 3659838b788 |
15 | 1b03708bc92 |
hex | e8dbcda95c |
1000120101212 has 24 divisors (see below), whose sum is σ = 1770166062000. Its totient is φ = 494360214656.
The previous prime is 1000120101209. The next prime is 1000120101271. The reversal of 1000120101212 is 2121010210001.
It is a super-2 number, since 2×10001201012122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000120101193 and 1000120101202.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1970039 + ... + 2425137.
It is an arithmetic number, because the mean of its divisors is an integer number (73756919250).
Almost surely, 21000120101212 is an apocalyptic number.
It is an amenable number.
1000120101212 is a deficient number, since it is larger than the sum of its proper divisors (770045960788).
1000120101212 is a wasteful number, since it uses less digits than its factorization.
1000120101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461365 (or 461363 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1000120101212 its reverse (2121010210001), we get a palindrome (3121130311213).
The spelling of 1000120101212 in words is "one trillion, one hundred twenty million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •