Base | Representation |
---|---|
bin | 10000110000111001010… |
… | …011001000111100011010 |
3 | 11002010112201212021110000 |
4 | 100300321103020330122 |
5 | 122333310203212020 |
6 | 2241121031033430 |
7 | 146141642066463 |
oct | 20607123107432 |
9 | 4063481767400 |
10 | 1152012554010 |
11 | 40462506571a |
12 | 16732680b876 |
13 | 84832799556 |
14 | 3da871ddd6a |
15 | 1ee76d88090 |
hex | 10c394c8f1a |
1152012554010 has 80 divisors (see below), whose sum is σ = 3097984525416. Its totient is φ = 307168561152.
The previous prime is 1152012553973. The next prime is 1152012554113. The reversal of 1152012554010 is 104552102511.
It is a happy number.
1152012554010 is a `hidden beast` number, since 1 + 1 + 5 + 2 + 0 + 1 + 255 + 401 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 799037544321 + 352975009689 = 893889^2 + 594117^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 7519534 + ... + 7671206.
Almost surely, 21152012554010 is an apocalyptic number.
1152012554010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1152012554010 is an abundant number, since it is smaller than the sum of its proper divisors (1945971971406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1152012554010 is a wasteful number, since it uses less digits than its factorization.
1152012554010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161069 (or 161060 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 1152012554010 its reverse (104552102511), we get a palindrome (1256564656521).
The spelling of 1152012554010 in words is "one trillion, one hundred fifty-two billion, twelve million, five hundred fifty-four thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •