Base | Representation |
---|---|
bin | 110110001010010101… |
… | …1101110010001100000 |
3 | 102010012220220020121212 |
4 | 1230110223232101200 |
5 | 3401201121414130 |
6 | 125233235005252 |
7 | 11255204143040 |
oct | 1542453562140 |
9 | 363186806555 |
10 | 116311123040 |
11 | 45366662282 |
12 | 1a660439828 |
13 | ac77b89538 |
14 | 58b545d720 |
15 | 305b1d9e95 |
hex | 1b14aee460 |
116311123040 has 48 divisors (see below), whose sum is σ = 314040035232. Its totient is φ = 39878098944.
The previous prime is 116311123031. The next prime is 116311123057. The reversal of 116311123040 is 40321113611.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 116311122997 and 116311123015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51923489 + ... + 51925728.
It is an arithmetic number, because the mean of its divisors is an integer number (6542500734).
Almost surely, 2116311123040 is an apocalyptic number.
116311123040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116311123040 is an abundant number, since it is smaller than the sum of its proper divisors (197728912192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116311123040 is a wasteful number, since it uses less digits than its factorization.
116311123040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103849239 (or 103849231 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 116311123040 its reverse (40321113611), we get a palindrome (156632236651).
The spelling of 116311123040 in words is "one hundred sixteen billion, three hundred eleven million, one hundred twenty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •