Base | Representation |
---|---|
bin | 110110001011111001… |
… | …0111110010001110100 |
3 | 102010100120011220202020 |
4 | 1230113302332101310 |
5 | 3401303004332002 |
6 | 125242342313140 |
7 | 11256410125404 |
oct | 1542762762164 |
9 | 363316156666 |
10 | 116363355252 |
11 | 453930980a1 |
12 | 1a675a287b0 |
13 | ac85946981 |
14 | 58bc378804 |
15 | 3060aa62bc |
hex | 1b17cbe474 |
116363355252 has 12 divisors (see below), whose sum is σ = 271514495616. Its totient is φ = 38787785080.
The previous prime is 116363355247. The next prime is 116363355257. The reversal of 116363355252 is 252553363611.
It is an interprime number because it is at equal distance from previous prime (116363355247) and next prime (116363355257).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116363355257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4848473124 + ... + 4848473147.
It is an arithmetic number, because the mean of its divisors is an integer number (22626207968).
Almost surely, 2116363355252 is an apocalyptic number.
116363355252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
116363355252 is an abundant number, since it is smaller than the sum of its proper divisors (155151140364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116363355252 is a wasteful number, since it uses less digits than its factorization.
116363355252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9696946278 (or 9696946276 counting only the distinct ones).
The product of its digits is 486000, while the sum is 42.
The spelling of 116363355252 in words is "one hundred sixteen billion, three hundred sixty-three million, three hundred fifty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •