Base | Representation |
---|---|
bin | 110110001000100100… |
… | …0011010101111011110 |
3 | 102010001202202221001102 |
4 | 1230101020122233132 |
5 | 3401040343130400 |
6 | 125223305513102 |
7 | 11253551516645 |
oct | 1542110325736 |
9 | 363052687042 |
10 | 116251536350 |
11 | 45335a63984 |
12 | 1a6444a2792 |
13 | ac68725741 |
14 | 58ab58c35c |
15 | 3055d699d5 |
hex | 1b1121abde |
116251536350 has 12 divisors (see below), whose sum is σ = 216227857704. Its totient is φ = 46500614520.
The previous prime is 116251536341. The next prime is 116251536353. The reversal of 116251536350 is 53635152611.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116251536353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1162515314 + ... + 1162515413.
It is an arithmetic number, because the mean of its divisors is an integer number (18018988142).
Almost surely, 2116251536350 is an apocalyptic number.
116251536350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
116251536350 is a deficient number, since it is larger than the sum of its proper divisors (99976321354).
116251536350 is a wasteful number, since it uses less digits than its factorization.
116251536350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2325030739 (or 2325030734 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 116251536350 its reverse (53635152611), we get a palindrome (169886688961).
The spelling of 116251536350 in words is "one hundred sixteen billion, two hundred fifty-one million, five hundred thirty-six thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •