Base | Representation |
---|---|
bin | 110101101101010111110001… |
… | …1101000110010101111010101 |
3 | 2021221201202011122120010222111 |
4 | 1223122233203220302233111 |
5 | 443410233033143021031 |
6 | 4352434434204231021 |
7 | 201336564520100542 |
oct | 15332574350625725 |
9 | 2257652148503874 |
10 | 472428746845141 |
11 | 1275919a7447159 |
12 | 44b9ba3353b471 |
13 | 1737babb9a6698 |
14 | 849395d961bc9 |
15 | 3993e510d91b1 |
hex | 1adabe3a32bd5 |
472428746845141 has 2 divisors, whose sum is σ = 472428746845142. Its totient is φ = 472428746845140.
The previous prime is 472428746845123. The next prime is 472428746845147. The reversal of 472428746845141 is 141548647824274.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 466286627256241 + 6142119588900 = 21593671^2 + 2478330^2 .
It is a cyclic number.
It is not a de Polignac number, because 472428746845141 - 221 = 472428744747989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (472428746845147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 236214373422570 + 236214373422571.
It is an arithmetic number, because the mean of its divisors is an integer number (236214373422571).
Almost surely, 2472428746845141 is an apocalyptic number.
It is an amenable number.
472428746845141 is a deficient number, since it is larger than the sum of its proper divisors (1).
472428746845141 is an equidigital number, since it uses as much as digits as its factorization.
472428746845141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 385351680, while the sum is 67.
The spelling of 472428746845141 in words is "four hundred seventy-two trillion, four hundred twenty-eight billion, seven hundred forty-six million, eight hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •