Base | Representation |
---|---|
bin | 10000111010010100100… |
… | …101101000000111100110 |
3 | 11010002200010021010120100 |
4 | 100322110211220013212 |
5 | 123020022304432132 |
6 | 2245513234044530 |
7 | 146650523352006 |
oct | 20722445500746 |
9 | 4102603233510 |
10 | 1162134061542 |
11 | 408949421083 |
12 | 169290419746 |
13 | 857866bab6c |
14 | 40367552006 |
15 | 2036a74837c |
hex | 10e949681e6 |
1162134061542 has 12 divisors (see below), whose sum is σ = 2517957133380. Its totient is φ = 387378020508.
The previous prime is 1162134061463. The next prime is 1162134061547. The reversal of 1162134061542 is 2451604312611.
1162134061542 is a `hidden beast` number, since 1 + 1 + 6 + 2 + 1 + 34 + 0 + 615 + 4 + 2 = 666.
It is a super-2 number, since 2×11621340615422 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1162134061497 and 1162134061506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1162134061547) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32281501692 + ... + 32281501727.
It is an arithmetic number, because the mean of its divisors is an integer number (209829761115).
Almost surely, 21162134061542 is an apocalyptic number.
1162134061542 is an abundant number, since it is smaller than the sum of its proper divisors (1355823071838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1162134061542 is a wasteful number, since it uses less digits than its factorization.
1162134061542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64563003427 (or 64563003424 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 1162134061542 in words is "one trillion, one hundred sixty-two billion, one hundred thirty-four million, sixty-one thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •