Base | Representation |
---|---|
bin | 10010111100010111… |
… | …01100110110111101 |
3 | 222020202202120220002 |
4 | 21132023230312331 |
5 | 131312013411341 |
6 | 4401055404045 |
7 | 510011041226 |
oct | 113613546675 |
9 | 28222676802 |
10 | 10170060221 |
11 | 4349808852 |
12 | 1b79b23625 |
13 | c60cc1019 |
14 | 6c699024d |
15 | 3e7ca129b |
hex | 25e2ecdbd |
10170060221 has 8 divisors (see below), whose sum is σ = 10221038520. Its totient is φ = 10119209472.
The previous prime is 10170060217. The next prime is 10170060223. The reversal of 10170060221 is 12206007101.
It can be written as a sum of positive squares in 4 ways, for example, as 514836100 + 9655224121 = 22690^2 + 98261^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10170060221 - 22 = 10170060217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10170060193 and 10170060202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10170060223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130025 + ... + 192993.
It is an arithmetic number, because the mean of its divisors is an integer number (1277629815).
Almost surely, 210170060221 is an apocalyptic number.
It is an amenable number.
10170060221 is a deficient number, since it is larger than the sum of its proper divisors (50978299).
10170060221 is an equidigital number, since it uses as much as digits as its factorization.
10170060221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63775.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 10170060221 its reverse (12206007101), we get a palindrome (22376067322).
The spelling of 10170060221 in words is "ten billion, one hundred seventy million, sixty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •