Base | Representation |
---|---|
bin | 11010011001001101001111… |
… | …011010100011100000100000 |
3 | 120020000021102021220010122220 |
4 | 122121031033122203200200 |
5 | 110203334213322021430 |
6 | 1050515022024031040 |
7 | 33310414432230111 |
oct | 3231151732434040 |
9 | 506007367803586 |
10 | 116081413470240 |
11 | 33a9493a738849 |
12 | 11029432602480 |
13 | 4ca057954ca8a |
14 | 20945284c6208 |
15 | d64825cc0110 |
hex | 69934f6a3820 |
116081413470240 has 96 divisors (see below), whose sum is σ = 367985474660160. Its totient is φ = 30757877689344.
The previous prime is 116081413470221. The next prime is 116081413470263. The reversal of 116081413470240 is 42074314180611.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 116081413470192 and 116081413470201.
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, 770103870 + ... + 770254589.
It is an arithmetic number, because the mean of its divisors is an integer number (3833182027710).
Almost surely, 2116081413470240 is an apocalyptic number.
116081413470240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116081413470240 is an abundant number, since it is smaller than the sum of its proper divisors (251904061189920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116081413470240 is a wasteful number, since it uses less digits than its factorization.
116081413470240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1540358634 (or 1540358626 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 42.
The spelling of 116081413470240 in words is "one hundred sixteen trillion, eighty-one billion, four hundred thirteen million, four hundred seventy thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •