Base | Representation |
---|---|
bin | 1001100001111101011000… |
… | …0101111010111001111001 |
3 | 1101002210011201102202210211 |
4 | 2120133112011322321321 |
5 | 2333142011340024121 |
6 | 34141554412111121 |
7 | 2131040545533634 |
oct | 230372605727171 |
9 | 41083151382724 |
10 | 10479017111161 |
11 | 3380142a76575 |
12 | 1212aa17654a1 |
13 | 5b02230a2a31 |
14 | 2832896d4c1b |
15 | 1328b38a8ce1 |
hex | 987d617ae79 |
10479017111161 has 9 divisors (see below), whose sum is σ = 10498277721711. Its totient is φ = 10459791790152.
The previous prime is 10479017111153. The next prime is 10479017111261. The reversal of 10479017111161 is 16111171097401.
The square root of 10479017111161 is 3237131.
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., 10447601675625 + 31415435536 = 3232275^2 + 177244^2 .
It is not a de Polignac number, because 10479017111161 - 23 = 10479017111153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10479017111261) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1964935851 + ... + 1964941183.
Almost surely, 210479017111161 is an apocalyptic number.
10479017111161 is the 3237131-st square number.
10479017111161 is the 1618566-th centered octagonal number.
It is an amenable number.
10479017111161 is a deficient number, since it is larger than the sum of its proper divisors (19260610550).
10479017111161 is an frugal number, since it uses more digits than its factorization.
10479017111161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11880 (or 5940 counting only the distinct ones).
The product of its (nonzero) digits is 10584, while the sum is 40.
The spelling of 10479017111161 in words is "ten trillion, four hundred seventy-nine billion, seventeen million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •