Base | Representation |
---|---|
bin | 1101110000011100010… |
… | …11100101010011010001 |
3 | 1200012002011221101120221 |
4 | 12320032023211103101 |
5 | 30221024141214303 |
6 | 1001052001233041 |
7 | 46102362266236 |
oct | 6701613452321 |
9 | 1605064841527 |
10 | 472684319953 |
11 | 172511a8080a |
12 | 77739032781 |
13 | 3575cc3c3a1 |
14 | 18c414c978d |
15 | c4679e34bd |
hex | 6e0e2e54d1 |
472684319953 has 2 divisors, whose sum is σ = 472684319954. Its totient is φ = 472684319952.
The previous prime is 472684319951. The next prime is 472684320001. The reversal of 472684319953 is 359913486274.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 297250672849 + 175433647104 = 545207^2 + 418848^2 .
It is a cyclic number.
It is not a de Polignac number, because 472684319953 - 21 = 472684319951 is a prime.
Together with 472684319951, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 472684319891 and 472684319900.
It is not a weakly prime, because it can be changed into another prime (472684319951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 236342159976 + 236342159977.
It is an arithmetic number, because the mean of its divisors is an integer number (236342159977).
Almost surely, 2472684319953 is an apocalyptic number.
It is an amenable number.
472684319953 is a deficient number, since it is larger than the sum of its proper divisors (1).
472684319953 is an equidigital number, since it uses as much as digits as its factorization.
472684319953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 39191040, while the sum is 61.
The spelling of 472684319953 in words is "four hundred seventy-two billion, six hundred eighty-four million, three hundred nineteen thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •