Base | Representation |
---|---|
bin | 10000111010010101100… |
… | …111110101000110100110 |
3 | 11010002201022220211201120 |
4 | 100322111213311012212 |
5 | 123020041230304410 |
6 | 2245515054034410 |
7 | 146651124022530 |
oct | 20722547650646 |
9 | 4102638824646 |
10 | 1162151416230 |
11 | 4089581a49a2 |
12 | 1692961a8a06 |
13 | 8578a1861cc |
14 | 4036998c850 |
15 | 2036c025570 |
hex | 10e959f51a6 |
1162151416230 has 64 divisors (see below), whose sum is σ = 3187701070848. Its totient is φ = 265627463040.
The previous prime is 1162151416177. The next prime is 1162151416273. The reversal of 1162151416230 is 326141512611.
It is a junction number, because it is equal to n+sod(n) for n = 1162151416191 and 1162151416200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15016935 + ... + 15094125.
It is an arithmetic number, because the mean of its divisors is an integer number (49807829232).
Almost surely, 21162151416230 is an apocalyptic number.
1162151416230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1162151416230 is an abundant number, since it is smaller than the sum of its proper divisors (2025549654618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1162151416230 is a wasteful number, since it uses less digits than its factorization.
1162151416230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148901.
The product of its (nonzero) digits is 8640, while the sum is 33.
Adding to 1162151416230 its reverse (326141512611), we get a palindrome (1488292928841).
The spelling of 1162151416230 in words is "one trillion, one hundred sixty-two billion, one hundred fifty-one million, four hundred sixteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •