Base | Representation |
---|---|
bin | 10000101111111011000… |
… | …111101011101000010000 |
3 | 11002000212000220200100110 |
4 | 100233323013223220100 |
5 | 122324141124103320 |
6 | 2240425323521320 |
7 | 146104044110244 |
oct | 20577307535020 |
9 | 4060760820313 |
10 | 1150969362960 |
11 | 40413a22185a |
12 | 167095389240 |
13 | 846c7619241 |
14 | 3d9c884c424 |
15 | 1ee154c45e0 |
hex | 10bfb1eba10 |
1150969362960 has 160 divisors (see below), whose sum is σ = 3665852013312. Its totient is φ = 298514626560.
The previous prime is 1150969362943. The next prime is 1150969362971. The reversal of 1150969362960 is 692639690511.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 1150969362960.
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, 24316437 + ... + 24363723.
Almost surely, 21150969362960 is an apocalyptic number.
1150969362960 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 1150969362960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1832926006656).
1150969362960 is an abundant number, since it is smaller than the sum of its proper divisors (2514882650352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1150969362960 is a wasteful number, since it uses less digits than its factorization.
1150969362960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50081 (or 50075 counting only the distinct ones).
The product of its (nonzero) digits is 4723920, while the sum is 57.
The spelling of 1150969362960 in words is "one trillion, one hundred fifty billion, nine hundred sixty-nine million, three hundred sixty-two thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •