Base | Representation |
---|---|
bin | 110110000010111110… |
… | …1111000011101100100 |
3 | 102002120201022112100121 |
4 | 1230011331320131210 |
5 | 3400144420200444 |
6 | 125152535051324 |
7 | 11246115431041 |
oct | 1540575703544 |
9 | 362521275317 |
10 | 116064225124 |
11 | 4524a258211 |
12 | 1a5b1810b44 |
13 | ac38991ab3 |
14 | 58907501c8 |
15 | 30446ba084 |
hex | 1b05f78764 |
116064225124 has 9 divisors (see below), whose sum is σ = 203113586361. Its totient is φ = 58031771880.
The previous prime is 116064225077. The next prime is 116064225133. The reversal of 116064225124 is 421522460611.
The square root of 116064225124 is 340682.
It is a perfect power (a square), and thus also a powerful number.
116064225124 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 19094265124 + 96969960000 = 138182^2 + 311400^2 .
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 116064225124.
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, 596194 + ... + 766534.
Almost surely, 2116064225124 is an apocalyptic number.
116064225124 is the 340682-nd square number.
It is an amenable number.
116064225124 is a deficient number, since it is larger than the sum of its proper divisors (87049361237).
116064225124 is an frugal number, since it uses more digits than its factorization.
116064225124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340686 (or 170343 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 116064225124 its reverse (421522460611), we get a palindrome (537586685735).
The spelling of 116064225124 in words is "one hundred sixteen billion, sixty-four million, two hundred twenty-five thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •