Base | Representation |
---|---|
bin | 11010011011101101000101… |
… | …011111001011010011011100 |
3 | 120020121200102122000202222010 |
4 | 122123231011133023103130 |
5 | 110214142214133222000 |
6 | 1051125524544151220 |
7 | 33326001562251333 |
oct | 3233550537132334 |
9 | 506550378022863 |
10 | 116253045601500 |
11 | 34050704593325 |
12 | 11056751908510 |
13 | 4cb37cc67c9b2 |
14 | 209c96ac18d1a |
15 | d6901da64d50 |
hex | 69bb457cb4dc |
116253045601500 has 96 divisors (see below), whose sum is σ = 338540587047936. Its totient is φ = 30999739060800.
The previous prime is 116253045601481. The next prime is 116253045601507. The reversal of 116253045601500 is 5106540352611.
It is a super-2 number, since 2×1162530456015002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116253045601507) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42483729 + ... + 45137271.
It is an arithmetic number, because the mean of its divisors is an integer number (3526464448416).
Almost surely, 2116253045601500 is an apocalyptic number.
116253045601500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116253045601500 is an abundant number, since it is smaller than the sum of its proper divisors (222287541446436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116253045601500 is a wasteful number, since it uses less digits than its factorization.
116253045601500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2682772 (or 2682760 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 116253045601500 in words is "one hundred sixteen trillion, two hundred fifty-three billion, forty-five million, six hundred one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •