Base | Representation |
---|---|
bin | 110110001101000001… |
… | …1011100101111010000 |
3 | 102010110012110002102110 |
4 | 1230122003130233100 |
5 | 3401342203310002 |
6 | 125250214145320 |
7 | 11260350055644 |
oct | 1543203345720 |
9 | 363405402373 |
10 | 116401228752 |
11 | 45402506006 |
12 | 1a686652240 |
13 | ac90747623 |
14 | 58c33d6c24 |
15 | 3064087e6c |
hex | 1b1a0dcbd0 |
116401228752 has 40 divisors (see below), whose sum is σ = 300752824000. Its totient is φ = 38794003200.
The previous prime is 116401228739. The next prime is 116401228753. The reversal of 116401228752 is 257822104611.
It is a super-3 number, since 3×1164012287523 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 116401228752.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116401228753) 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, 98124 + ... + 492372.
It is an arithmetic number, because the mean of its divisors is an integer number (7518820600).
Almost surely, 2116401228752 is an apocalyptic number.
116401228752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116401228752 is an abundant number, since it is smaller than the sum of its proper divisors (184351595248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116401228752 is a wasteful number, since it uses less digits than its factorization.
116401228752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400411 (or 400405 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 39.
The spelling of 116401228752 in words is "one hundred sixteen billion, four hundred one million, two hundred twenty-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •