Base | Representation |
---|---|
bin | 10000110110010100010… |
… | …000101111010000000000 |
3 | 11002200120102012222122121 |
4 | 100312110100233100000 |
5 | 122432220401242212 |
6 | 2243522412414024 |
7 | 146436124242001 |
oct | 20662420572000 |
9 | 4080512188577 |
10 | 1157833618432 |
11 | 407041990567 |
12 | 168490177314 |
13 | 8524c774a7a |
14 | 4007a3511a8 |
15 | 201b7e27d07 |
hex | 10d9442f400 |
1157833618432 has 176 divisors, whose sum is σ = 2404792509840. Its totient is φ = 556793856000.
The previous prime is 1157833618397. The next prime is 1157833618441. The reversal of 1157833618432 is 2348163387511.
It can be written as a sum of positive squares in 8 ways, for example, as 33351525376 + 1124482093056 = 182624^2 + 1060416^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1157833618432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1633051294 + ... + 1633052002.
Almost surely, 21157833618432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1157833618432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1202396254920).
1157833618432 is an abundant number, since it is smaller than the sum of its proper divisors (1246958891408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1157833618432 is an equidigital number, since it uses as much as digits as its factorization.
1157833618432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1268 (or 1250 counting only the distinct ones).
The product of its digits is 2903040, while the sum is 52.
The spelling of 1157833618432 in words is "one trillion, one hundred fifty-seven billion, eight hundred thirty-three million, six hundred eighteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •