Base | Representation |
---|---|
bin | 11010011011001110100010… |
… | …110110111001111000111110 |
3 | 120020111112210012202201120020 |
4 | 122123032202312321320332 |
5 | 110213123034101124400 |
6 | 1051102502531233010 |
7 | 33323431124322051 |
oct | 3233164266717076 |
9 | 506445705681506 |
10 | 116220252364350 |
11 | 34038806670942 |
12 | 1105031b448766 |
13 | 4cb06a46b7964 |
14 | 209b13982aa98 |
15 | d6824eada2a0 |
hex | 69b3a2db9e3e |
116220252364350 has 48 divisors (see below), whose sum is σ = 297523846064640. Its totient is φ = 29992323189600.
The previous prime is 116220252364297. The next prime is 116220252364379. The reversal of 116220252364350 is 53463252022611.
116220252364350 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12496796680 + ... + 12496805979.
It is an arithmetic number, because the mean of its divisors is an integer number (6198413459680).
Almost surely, 2116220252364350 is an apocalyptic number.
116220252364350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116220252364350 is an abundant number, since it is smaller than the sum of its proper divisors (181303593700290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116220252364350 is a wasteful number, since it uses less digits than its factorization.
116220252364350 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24993602705 (or 24993602700 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 116220252364350 in words is "one hundred sixteen trillion, two hundred twenty billion, two hundred fifty-two million, three hundred sixty-four thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.313 sec. • engine limits •