Base | Representation |
---|---|
bin | 10000110100111010110… |
… | …100011011011101110110 |
3 | 11002112200211120221122100 |
4 | 100310322310123131312 |
5 | 122421132223301032 |
6 | 2243113445442530 |
7 | 146354003353311 |
oct | 20647264333566 |
9 | 4075624527570 |
10 | 1156333025142 |
11 | 406441935619 |
12 | 168131710446 |
13 | 85070905749 |
14 | 3dd76d35978 |
15 | 2012b31297c |
hex | 10d3ad1b776 |
1156333025142 has 12 divisors (see below), whose sum is σ = 2505388221180. Its totient is φ = 385444341708.
The previous prime is 1156333025129. The next prime is 1156333025149. The reversal of 1156333025142 is 2415203336511.
1156333025142 is a `hidden beast` number, since 1 + 1 + 5 + 633 + 3 + 0 + 2 + 5 + 14 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 1156333025097 and 1156333025106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1156333025149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32120361792 + ... + 32120361827.
It is an arithmetic number, because the mean of its divisors is an integer number (208782351765).
Almost surely, 21156333025142 is an apocalyptic number.
1156333025142 is an abundant number, since it is smaller than the sum of its proper divisors (1349055196038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1156333025142 is a wasteful number, since it uses less digits than its factorization.
1156333025142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64240723627 (or 64240723624 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
The spelling of 1156333025142 in words is "one trillion, one hundred fifty-six billion, three hundred thirty-three million, twenty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •