Base | Representation |
---|---|
bin | 110110011010101110… |
… | …0010101110011110001 |
3 | 102011122020002121201011 |
4 | 1230311130111303301 |
5 | 3403312322120201 |
6 | 125403551110521 |
7 | 11304626614252 |
oct | 1546534256361 |
9 | 364566077634 |
10 | 116860738801 |
11 | 45618927784 |
12 | 1a794512441 |
13 | b0349c3b71 |
14 | 592844cb29 |
15 | 308e5a4151 |
hex | 1b35715cf1 |
116860738801 has 27 divisors (see below), whose sum is σ = 124294838731. Its totient is φ = 109862064224.
The previous prime is 116860738793. The next prime is 116860738807. The reversal of 116860738801 is 108837068611.
The square root of 116860738801 is 341849.
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., 22439740401 + 94420998400 = 149799^2 + 307280^2 .
It is not a de Polignac number, because 116860738801 - 23 = 116860738793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116860738807) 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, 699764820 + ... + 699764986.
Almost surely, 2116860738801 is an apocalyptic number.
116860738801 is the 341849-th square number.
116860738801 is the 170925-th centered octagonal number.
It is an amenable number.
116860738801 is a deficient number, since it is larger than the sum of its proper divisors (7434099930).
116860738801 is an frugal number, since it uses more digits than its factorization.
116860738801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558 (or 279 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 49.
Multiplying 116860738801 by its sum of digits (49), we get a square (5726176201249 = 23929432).
The spelling of 116860738801 in words is "one hundred sixteen billion, eight hundred sixty million, seven hundred thirty-eight thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •