Base | Representation |
---|---|
bin | 1101110001110010011… |
… | …00010001101011101001 |
3 | 1200020221110202120112121 |
4 | 12320321030101223221 |
5 | 30224013404001100 |
6 | 1001251335511241 |
7 | 46126303641331 |
oct | 6707114215351 |
9 | 1606843676477 |
10 | 473405922025 |
11 | 172852335063 |
12 | 778ba828521 |
13 | 358465a316a |
14 | 18cad2880c1 |
15 | c4ab03151a |
hex | 6e39311ae9 |
473405922025 has 81 divisors (see below), whose sum is σ = 637392151557. Its totient is φ = 348756249600.
The previous prime is 473405921999. The next prime is 473405922029. The reversal of 473405922025 is 520229504374.
The square root of 473405922025 is 688045.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 76137916761 + 397268005264 = 275931^2 + 630292^2 .
It is not a de Polignac number, because 473405922025 - 211 = 473405919977 is a prime.
It is a super-2 number, since 2×4734059220252 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (473405922029) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 2452880329 + ... + 2452880521.
Almost surely, 2473405922025 is an apocalyptic number.
473405922025 is the 688045-th square number.
473405922025 is the 344023-rd centered octagonal number.
It is an amenable number.
473405922025 is a deficient number, since it is larger than the sum of its proper divisors (163986229532).
473405922025 is an equidigital number, since it uses as much as digits as its factorization.
473405922025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 504 (or 252 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 43.
The spelling of 473405922025 in words is "four hundred seventy-three billion, four hundred five million, nine hundred twenty-two thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •