Base | Representation |
---|---|
bin | 110101101111101100110001… |
… | …1001100111011001000110001 |
3 | 2021222212100001202100101011002 |
4 | 1223133121203030323020301 |
5 | 443431003331414244212 |
6 | 4353241432235531345 |
7 | 201401652566132654 |
oct | 15337314314731061 |
9 | 2258770052311132 |
10 | 472748714603057 |
11 | 1276a5670950522 |
12 | 45031a4bbb9b55 |
13 | 173a3021601559 |
14 | 84a523499589b |
15 | 399c42b795ac2 |
hex | 1adf66333b231 |
472748714603057 has 8 divisors (see below), whose sum is σ = 472953417661440. Its totient is φ = 472544028714240.
The previous prime is 472748714603023. The next prime is 472748714603063. The reversal of 472748714603057 is 750306417847274.
It is a happy number.
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 472748714603057 - 240 = 471649202975281 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 472748714602984 and 472748714603002.
It is not an unprimeable number, because it can be changed into a prime (472748714603857) 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, 50941544 + ... + 59502422.
It is an arithmetic number, because the mean of its divisors is an integer number (59119177207680).
Almost surely, 2472748714603057 is an apocalyptic number.
It is an amenable number.
472748714603057 is a deficient number, since it is larger than the sum of its proper divisors (204703058383).
472748714603057 is a wasteful number, since it uses less digits than its factorization.
472748714603057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8584783.
The product of its (nonzero) digits is 221276160, while the sum is 65.
The spelling of 472748714603057 in words is "four hundred seventy-two trillion, seven hundred forty-eight billion, seven hundred fourteen million, six hundred three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •