Base | Representation |
---|---|
bin | 1010000001111011100… |
… | …0000001111110001001 |
3 | 121110210001021011012210 |
4 | 2200132320001332021 |
5 | 10310401033241312 |
6 | 211054452455333 |
7 | 15310111516143 |
oct | 2403670017611 |
9 | 543701234183 |
10 | 172316696457 |
11 | 67096312544 |
12 | 2949061a549 |
13 | 13331bc6aa9 |
14 | 84a960dc93 |
15 | 4737e18e3c |
hex | 281ee01f89 |
172316696457 has 16 divisors (see below), whose sum is σ = 230342386880. Its totient is φ = 114584500800.
The previous prime is 172316696449. The next prime is 172316696467. The reversal of 172316696457 is 754696613271.
It is not a de Polignac number, because 172316696457 - 23 = 172316696449 is a prime.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 172316696397 and 172316696406.
It is not an unprimeable number, because it can be changed into a prime (172316696467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11080107 + ... + 11095647.
It is an arithmetic number, because the mean of its divisors is an integer number (14396399180).
Almost surely, 2172316696457 is an apocalyptic number.
It is an amenable number.
172316696457 is a deficient number, since it is larger than the sum of its proper divisors (58025690423).
172316696457 is a wasteful number, since it uses less digits than its factorization.
172316696457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24744.
The product of its digits is 11430720, while the sum is 57.
The spelling of 172316696457 in words is "one hundred seventy-two billion, three hundred sixteen million, six hundred ninety-six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •