Base | Representation |
---|---|
bin | 10000011101001111100… |
… | …111110100100110111111 |
3 | 11000010002012220011102000 |
4 | 100131033213310212333 |
5 | 122012102013104030 |
6 | 2223311154033343 |
7 | 144464026262310 |
oct | 20351747644677 |
9 | 4003065804360 |
10 | 1130912238015 |
11 | 3a6687525a3a |
12 | 163218278853 |
13 | 8284c160181 |
14 | 3ca44b36607 |
15 | 1e63e722860 |
hex | 1074f9f49bf |
1130912238015 has 768 divisors, whose sum is σ = 2688978124800. Its totient is φ = 440374910976.
The previous prime is 1130912238013. The next prime is 1130912238119. The reversal of 1130912238015 is 5108322190311.
It is not a de Polignac number, because 1130912238015 - 21 = 1130912238013 is a prime.
It is a super-2 number, since 2×11309122380152 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130912238013) by changing a digit.
It is a polite number, since it can be written in 767 ways as a sum of consecutive naturals, for example, 14315344746 + ... + 14315344824.
It is an arithmetic number, because the mean of its divisors is an integer number (3501273600).
Almost surely, 21130912238015 is an apocalyptic number.
1130912238015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1130912238015 is an abundant number, since it is smaller than the sum of its proper divisors (1558065886785).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130912238015 is a wasteful number, since it uses less digits than its factorization.
1130912238015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253 (or 230 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The spelling of 1130912238015 in words is "one trillion, one hundred thirty billion, nine hundred twelve million, two hundred thirty-eight thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •