Base | Representation |
---|---|
bin | 1101101111010111100… |
… | …10100100110110001101 |
3 | 1200010120222020201201112 |
4 | 12313223302210312031 |
5 | 30213333434323044 |
6 | 1000514430421405 |
7 | 46052155112405 |
oct | 6675362446615 |
9 | 1603528221645 |
10 | 472107339149 |
11 | 172246315576 |
12 | 775b7961865 |
13 | 3569a543224 |
14 | 18bc8a15805 |
15 | c43202109e |
hex | 6debca4d8d |
472107339149 has 2 divisors, whose sum is σ = 472107339150. Its totient is φ = 472107339148.
The previous prime is 472107339101. The next prime is 472107339157. The reversal of 472107339149 is 941933701274.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 342728284900 + 129379054249 = 585430^2 + 359693^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-472107339149 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 472107339097 and 472107339106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (472107336149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 236053669574 + 236053669575.
It is an arithmetic number, because the mean of its divisors is an integer number (236053669575).
Almost surely, 2472107339149 is an apocalyptic number.
It is an amenable number.
472107339149 is a deficient number, since it is larger than the sum of its proper divisors (1).
472107339149 is an equidigital number, since it uses as much as digits as its factorization.
472107339149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 50.
The spelling of 472107339149 in words is "four hundred seventy-two billion, one hundred seven million, three hundred thirty-nine thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •