Base | Representation |
---|---|
bin | 111100010100111… |
… | …011111000011111 |
3 | 2121112111002011101 |
4 | 330110323320133 |
5 | 4033100333434 |
6 | 244233133531 |
7 | 34036613302 |
oct | 7424737037 |
9 | 2545432141 |
10 | 1012121119 |
11 | 47a352639 |
12 | 242b5a2a7 |
13 | 1318c2349 |
14 | 985c4b39 |
15 | 5dcc7b14 |
hex | 3c53be1f |
1012121119 has 4 divisors (see below), whose sum is σ = 1012262944. Its totient is φ = 1011979296.
The previous prime is 1012121113. The next prime is 1012121137. The reversal of 1012121119 is 9111212101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1012121119 - 215 = 1012088351 is a prime.
It is a super-2 number, since 2×10121211192 = 2048778319051624322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012121096 and 1012121105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012121113) 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 3 ways as a sum of consecutive naturals, for example, 59607 + ... + 74680.
It is an arithmetic number, because the mean of its divisors is an integer number (253065736).
Almost surely, 21012121119 is an apocalyptic number.
1012121119 is a deficient number, since it is larger than the sum of its proper divisors (141825).
1012121119 is an equidigital number, since it uses as much as digits as its factorization.
1012121119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141824.
The product of its (nonzero) digits is 36, while the sum is 19.
The square root of 1012121119 is about 31813.8510557901. The cubic root of 1012121119 is about 1004.0241574347.
The spelling of 1012121119 in words is "one billion, twelve million, one hundred twenty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •