Base | Representation |
---|---|
bin | 110110011001110111… |
… | …0101000011100001000 |
3 | 102011120012222111001102 |
4 | 1230303232220130020 |
5 | 3403232441314042 |
6 | 125401042440532 |
7 | 11304130303241 |
oct | 1546356503410 |
9 | 364505874042 |
10 | 116831979272 |
11 | 45603674278 |
12 | 1a786963148 |
13 | b02ba646a8 |
14 | 59246c3cc8 |
15 | 308bcc2b32 |
hex | 1b33ba8708 |
116831979272 has 12 divisors (see below), whose sum is σ = 219061773855. Its totient is φ = 58415506248.
The previous prime is 116831979221. The next prime is 116831979323. The reversal of 116831979272 is 272979138611.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is an interprime number because it is at equal distance from previous prime (116831979221) and next prime (116831979323).
It can be written as a sum of positive squares in only one way, i.e., 58415989636 + 58415989636 = 241694^2 + 241694^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=241694.
It is a super-2 number, since 2×1168319792722 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 906353 + ... + 1027199.
Almost surely, 2116831979272 is an apocalyptic number.
It is an amenable number.
116831979272 is a deficient number, since it is larger than the sum of its proper divisors (102229794583).
116831979272 is an frugal number, since it uses more digits than its factorization.
116831979272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241700 (or 120849 counting only the distinct ones).
The product of its digits is 2286144, while the sum is 56.
The spelling of 116831979272 in words is "one hundred sixteen billion, eight hundred thirty-one million, nine hundred seventy-nine thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •