Base | Representation |
---|---|
bin | 100111001101000110000001… |
… | …111011101100010001111011 |
3 | 211121111112120001221220012011 |
4 | 213031012001323230101323 |
5 | 140044442104323203101 |
6 | 1410414154433430351 |
7 | 51214124405016430 |
oct | 4715060173542173 |
9 | 747445501856164 |
10 | 172423642006651 |
11 | 4aa37501923a52 |
12 | 17408a34a0b3b7 |
13 | 7529630ac7099 |
14 | 30814c5177b87 |
15 | 14e0204515751 |
hex | 9cd181eec47b |
172423642006651 has 8 divisors (see below), whose sum is σ = 197405600799744. Its totient is φ = 147529185697320.
The previous prime is 172423642006613. The next prime is 172423642006669. The reversal of 172423642006651 is 156600246324271.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 172423642006651 - 213 = 172423641998459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 172423642006595 and 172423642006604.
It is not an unprimeable number, because it can be changed into a prime (172423642006051) 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, 21875616715 + ... + 21875624596.
It is an arithmetic number, because the mean of its divisors is an integer number (24675700099968).
Almost surely, 2172423642006651 is an apocalyptic number.
172423642006651 is a deficient number, since it is larger than the sum of its proper divisors (24981958793093).
172423642006651 is an equidigital number, since it uses as much as digits as its factorization.
172423642006651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43751241881.
The product of its (nonzero) digits is 2903040, while the sum is 49.
The spelling of 172423642006651 in words is "one hundred seventy-two trillion, four hundred twenty-three billion, six hundred forty-two million, six thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •