Base | Representation |
---|---|
bin | 10000110011111110000… |
… | …000111111000000000000 |
3 | 11002110001202001112120210 |
4 | 100303332000333000000 |
5 | 122412040100444430 |
6 | 2242424325034120 |
7 | 146316505446603 |
oct | 20637600770000 |
9 | 4073052045523 |
10 | 1155312906240 |
11 | 405a69020149 |
12 | 167aa7b55940 |
13 | 84c3a472cac |
14 | 3dcbb66c33a |
15 | 200bb9aa2b0 |
hex | 10cfe03f000 |
1155312906240 has 416 divisors, whose sum is σ = 3978377349696. Its totient is φ = 285191700480.
The previous prime is 1155312906133. The next prime is 1155312906259. The reversal of 1155312906240 is 426092135511.
It is a happy number.
It is a super-2 number, since 2×11553129062402 (a number of 25 digits) contains 22 as substring.
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, 63704214 + ... + 63722346.
Almost surely, 21155312906240 is an apocalyptic number.
1155312906240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1155312906240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1989188674848).
1155312906240 is an abundant number, since it is smaller than the sum of its proper divisors (2823064443456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1155312906240 is a wasteful number, since it uses less digits than its factorization.
1155312906240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18243 (or 18221 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
The spelling of 1155312906240 in words is "one trillion, one hundred fifty-five billion, three hundred twelve million, nine hundred six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •