Base | Representation |
---|---|
bin | 10000011100100101001… |
… | …010111001000100001011 |
3 | 11000001020120201021122101 |
4 | 100130211022321010023 |
5 | 122004122200323034 |
6 | 2223112352334231 |
7 | 144440260404622 |
oct | 20344512710413 |
9 | 4001216637571 |
10 | 1130200011019 |
11 | 3a6351495292 |
12 | 163059844377 |
13 | 8276772c691 |
14 | 3c9b82d86b9 |
15 | 1e5ebe37514 |
hex | 107252b910b |
1130200011019 has 8 divisors (see below), whose sum is σ = 1141417647792. Its totient is φ = 1118982914400.
The previous prime is 1130200010993. The next prime is 1130200011077. The reversal of 1130200011019 is 9101100020311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1130200011019 - 29 = 1130200010507 is a prime.
It is a super-2 number, since 2×11302000110192 (a number of 25 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 = 1130200010987 and 1130200011005.
It is not an unprimeable number, because it can be changed into a prime (1130200011119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5055012 + ... + 5273854.
It is an arithmetic number, because the mean of its divisors is an integer number (142677205974).
Almost surely, 21130200011019 is an apocalyptic number.
1130200011019 is a deficient number, since it is larger than the sum of its proper divisors (11217636773).
1130200011019 is a wasteful number, since it uses less digits than its factorization.
1130200011019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270077.
The product of its (nonzero) digits is 54, while the sum is 19.
The spelling of 1130200011019 in words is "one trillion, one hundred thirty billion, two hundred million, eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •