Base | Representation |
---|---|
bin | 10010111100100000… |
… | …01000001000110011 |
3 | 222020211221112112112 |
4 | 21132100020020303 |
5 | 131312313024111 |
6 | 4401140315535 |
7 | 510023643113 |
oct | 113620101063 |
9 | 28224845475 |
10 | 10171220531 |
11 | 434a43058a |
12 | 1b7a3a2bab |
13 | c613091b4 |
14 | 6c6bb3043 |
15 | 3e7e2ee8b |
hex | 25e408233 |
10171220531 has 8 divisors (see below), whose sum is σ = 10223282160. Its totient is φ = 10119231232.
The previous prime is 10171220461. The next prime is 10171220557. The reversal of 10171220531 is 13502217101.
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 10171220531 - 222 = 10167026227 is a prime.
It is a super-2 number, since 2×101712205312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10171220497 and 10171220506.
It is not an unprimeable number, because it can be changed into a prime (10171220131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 276011 + ... + 310683.
It is an arithmetic number, because the mean of its divisors is an integer number (1277910270).
Almost surely, 210171220531 is an apocalyptic number.
10171220531 is a deficient number, since it is larger than the sum of its proper divisors (52061629).
10171220531 is a wasteful number, since it uses less digits than its factorization.
10171220531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36165.
The product of its (nonzero) digits is 420, while the sum is 23.
Adding to 10171220531 its reverse (13502217101), we get a palindrome (23673437632).
The spelling of 10171220531 in words is "ten billion, one hundred seventy-one million, two hundred twenty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •