Base | Representation |
---|---|
bin | 10000011100111001001… |
… | …000110101001011011111 |
3 | 11000002002221002020220020 |
4 | 100130321020311023133 |
5 | 122010313430441020 |
6 | 2223205520523223 |
7 | 144451466034201 |
oct | 20347110651337 |
9 | 4002087066806 |
10 | 1130535015135 |
11 | 3a65035a7899 |
12 | 163131a80513 |
13 | 827bbc65076 |
14 | 3ca0a9c0771 |
15 | 1e61b55cc40 |
hex | 107392352df |
1130535015135 has 64 divisors (see below), whose sum is σ = 1836021841920. Its totient is φ = 593966505600.
The previous prime is 1130535015109. The next prime is 1130535015149. The reversal of 1130535015135 is 5315105350311.
It is not a de Polignac number, because 1130535015135 - 27 = 1130535015007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1130535015096 and 1130535015105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 579463410 + ... + 579465360.
It is an arithmetic number, because the mean of its divisors is an integer number (28687841280).
Almost surely, 21130535015135 is an apocalyptic number.
1130535015135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1130535015135 is a deficient number, since it is larger than the sum of its proper divisors (705486826785).
1130535015135 is a wasteful number, since it uses less digits than its factorization.
1130535015135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3908.
The product of its (nonzero) digits is 16875, while the sum is 33.
The spelling of 1130535015135 in words is "one trillion, one hundred thirty billion, five hundred thirty-five million, fifteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •