Base | Representation |
---|---|
bin | 110101110000010000100110… |
… | …0000010010101101001000101 |
3 | 2022000010200121111022212102201 |
4 | 1223200201030002111221011 |
5 | 443433233400123112042 |
6 | 4353341033114434501 |
7 | 201410345010613321 |
oct | 15340411402255105 |
9 | 2260120544285381 |
10 | 472825635363397 |
11 | 127725253695238 |
12 | 45044938732a31 |
13 | 173aa35c7c9864 |
14 | 84a8c507bc981 |
15 | 399e42e76c1b7 |
hex | 1ae084c095a45 |
472825635363397 has 2 divisors, whose sum is σ = 472825635363398. Its totient is φ = 472825635363396.
The previous prime is 472825635363353. The next prime is 472825635363461. The reversal of 472825635363397 is 793363536528274.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 466701663551841 + 6123971811556 = 21603279^2 + 2474666^2 .
It is a cyclic number.
It is not a de Polignac number, because 472825635363397 - 247 = 332088147008069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (472825635363337) 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, 236412817681698 + 236412817681699.
It is an arithmetic number, because the mean of its divisors is an integer number (236412817681699).
Almost surely, 2472825635363397 is an apocalyptic number.
It is an amenable number.
472825635363397 is a deficient number, since it is larger than the sum of its proper divisors (1).
472825635363397 is an equidigital number, since it uses as much as digits as its factorization.
472825635363397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4115059200, while the sum is 73.
The spelling of 472825635363397 in words is "four hundred seventy-two trillion, eight hundred twenty-five billion, six hundred thirty-five million, three hundred sixty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •