Base | Representation |
---|---|
bin | 1001010000000000101101… |
… | …0000001010101001001001 |
3 | 1100000022021120110212001201 |
4 | 2110000023100022221021 |
5 | 2313114013331003301 |
6 | 33344201504144201 |
7 | 2066543501004214 |
oct | 224001320125111 |
9 | 40008246425051 |
10 | 10170671344201 |
11 | 32713a2909005 |
12 | 1183189308061 |
13 | 58a1231ca7a4 |
14 | 27239800077b |
15 | 1298686a0201 |
hex | 9400b40aa49 |
10170671344201 has 9 divisors (see below), whose sum is σ = 10804196356149. Its totient is φ = 9572345532864.
The previous prime is 10170671344177. The next prime is 10170671344271. The reversal of 10170671344201 is 10244317607101.
The square root of 10170671344201 is 3189149.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 81281439801 + 10089389904400 = 285099^2 + 3176380^2 .
It is not a de Polignac number, because 10170671344201 - 219 = 10170670819913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10170671344271) 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, 54121735 + ... + 54309331.
Almost surely, 210170671344201 is an apocalyptic number.
10170671344201 is the 3189149-th square number.
10170671344201 is the 1594575-th centered octagonal number.
It is an amenable number.
10170671344201 is a deficient number, since it is larger than the sum of its proper divisors (633525011948).
10170671344201 is an frugal number, since it uses more digits than its factorization.
10170671344201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 375228 (or 187614 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 37.
The spelling of 10170671344201 in words is "ten trillion, one hundred seventy billion, six hundred seventy-one million, three hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •