Base | Representation |
---|---|
bin | 110110011101011010… |
… | …0101011010011001001 |
3 | 102011212111221120210001 |
4 | 1230322310223103021 |
5 | 3404003424114421 |
6 | 125420533523001 |
7 | 11310104064202 |
oct | 1547264532311 |
9 | 364774846701 |
10 | 116951004361 |
11 | 4566487a614 |
12 | 1a7ba7a3461 |
13 | b04a609939 |
14 | 59364285a9 |
15 | 3097484691 |
hex | 1b3ad2b4c9 |
116951004361 has 27 divisors (see below), whose sum is σ = 126803049543. Its totient is φ = 107847128160.
The previous prime is 116951004347. The next prime is 116951004403. The reversal of 116951004361 is 163400159611.
The square root of 116951004361 is 341981.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5635354761 + 111315649600 = 75069^2 + 333640^2 .
It is not a de Polignac number, because 116951004361 - 211 = 116951002313 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116951004361.
It is not an unprimeable number, because it can be changed into a prime (116951004761) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 266402980 + ... + 266403418.
Almost surely, 2116951004361 is an apocalyptic number.
116951004361 is the 341981-st square number.
116951004361 is the 170991-st centered octagonal number.
It is an amenable number.
116951004361 is a deficient number, since it is larger than the sum of its proper divisors (9852045182).
116951004361 is an frugal number, since it uses more digits than its factorization.
116951004361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 998 (or 499 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 37.
The spelling of 116951004361 in words is "one hundred sixteen billion, nine hundred fifty-one million, four thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •