Base | Representation |
---|---|
bin | 10000010011000101110… |
… | …011000110001011001111 |
3 | 10222001221102102020201120 |
4 | 100103011303012023033 |
5 | 121322240030100101 |
6 | 2214305301212023 |
7 | 143626614643104 |
oct | 20230563061317 |
9 | 3861842366646 |
10 | 1120010003151 |
11 | 3a1aa24a2586 |
12 | 161095101013 |
13 | 81802576020 |
14 | 3c2ccc34aab |
15 | 1e202545b36 |
hex | 104c5cc62cf |
1120010003151 has 16 divisors (see below), whose sum is σ = 1608238571520. Its totient is φ = 689228748000.
The previous prime is 1120010003113. The next prime is 1120010003173. The reversal of 1120010003151 is 1513000100211.
It is not a de Polignac number, because 1120010003151 - 213 = 1120009994959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1120010003151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120010005151) 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 15 ways as a sum of consecutive naturals, for example, 5871526 + ... + 6059276.
It is an arithmetic number, because the mean of its divisors is an integer number (100514910720).
Almost surely, 21120010003151 is an apocalyptic number.
1120010003151 is a deficient number, since it is larger than the sum of its proper divisors (488228568369).
1120010003151 is a wasteful number, since it uses less digits than its factorization.
1120010003151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340726.
The product of its (nonzero) digits is 30, while the sum is 15.
Adding to 1120010003151 its reverse (1513000100211), we get a palindrome (2633010103362).
The spelling of 1120010003151 in words is "one trillion, one hundred twenty billion, ten million, three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •