Base | Representation |
---|---|
bin | 110110000010000011… |
… | …1111011001000000000 |
3 | 102002111120010112020020 |
4 | 1230010013323020000 |
5 | 3400114011144130 |
6 | 125145512213440 |
7 | 11245261542144 |
oct | 1540407731000 |
9 | 362446115206 |
10 | 116033303040 |
11 | 45233857a76 |
12 | 1a5a339a280 |
13 | ac324561c5 |
14 | 588a5c1224 |
15 | 3041b0ce10 |
hex | 1b041fb200 |
116033303040 has 80 divisors (see below), whose sum is σ = 370943990208. Its totient is φ = 30942212096.
The previous prime is 116033302961. The next prime is 116033303041. The reversal of 116033303040 is 40303330611.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 116033303040.
It is not an unprimeable number, because it can be changed into a prime (116033303041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7546572 + ... + 7561931.
Almost surely, 2116033303040 is an apocalyptic number.
116033303040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116033303040 is an abundant number, since it is smaller than the sum of its proper divisors (254910687168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116033303040 is an equidigital number, since it uses as much as digits as its factorization.
116033303040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15108529 (or 15108513 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 116033303040 its reverse (40303330611), we get a palindrome (156336633651).
The spelling of 116033303040 in words is "one hundred sixteen billion, thirty-three million, three hundred three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •