Base | Representation |
---|---|
bin | 1101000001100000001… |
… | …01101100110011000100 |
3 | 1120210000212221222112201 |
4 | 12200300011230303010 |
5 | 24312421222234424 |
6 | 541323202124244 |
7 | 44221025064451 |
oct | 6406005546304 |
9 | 1523025858481 |
10 | 447483399364 |
11 | 16285a793111 |
12 | 72885350684 |
13 | 33274bb8861 |
14 | 179305a0828 |
15 | b990383d44 |
hex | 683016ccc4 |
447483399364 has 27 divisors (see below), whose sum is σ = 796734266797. Its totient is φ = 219910668848.
The previous prime is 447483399353. The next prime is 447483399449. The reversal of 447483399364 is 463993384744.
The square root of 447483399364 is 668942.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 107687672964 + 339795726400 = 328158^2 + 582920^2 .
It is a super-2 number, since 2×4474833993642 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 447483399296 and 447483399305.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 78932322 + ... + 78937990.
Almost surely, 2447483399364 is an apocalyptic number.
447483399364 is the 668942-nd square number.
It is an amenable number.
447483399364 is a deficient number, since it is larger than the sum of its proper divisors (349250867433).
447483399364 is an frugal number, since it uses more digits than its factorization.
447483399364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11460 (or 5730 counting only the distinct ones).
The product of its digits is 188116992, while the sum is 64.
Multiplying 447483399364 by its sum of digits (64), we get a square (28638937559296 = 53515362).
The spelling of 447483399364 in words is "four hundred forty-seven billion, four hundred eighty-three million, three hundred ninety-nine thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •