Base | Representation |
---|---|
bin | 10011000010101… |
… | …100001101110001 |
3 | 211021010212212201 |
4 | 103002230031301 |
5 | 1123241104442 |
6 | 51411223201 |
7 | 10626320461 |
oct | 2302541561 |
9 | 737125781 |
10 | 319472497 |
11 | 154374463 |
12 | 8aba7b01 |
13 | 512580a6 |
14 | 30601ba1 |
15 | 1d0a87b7 |
hex | 130ac371 |
319472497 has 4 divisors (see below), whose sum is σ = 330488820. Its totient is φ = 308456176.
The previous prime is 319472459. The next prime is 319472513. The reversal of 319472497 is 794274913.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 173159281 + 146313216 = 13159^2 + 12096^2 .
It is a cyclic number.
It is not a de Polignac number, because 319472497 - 211 = 319470449 is a prime.
It is a super-3 number, since 3×3194724973 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (319472297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5508118 + ... + 5508175.
It is an arithmetic number, because the mean of its divisors is an integer number (82622205).
Almost surely, 2319472497 is an apocalyptic number.
It is an amenable number.
319472497 is a deficient number, since it is larger than the sum of its proper divisors (11016323).
319472497 is a wasteful number, since it uses less digits than its factorization.
319472497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11016322.
The product of its digits is 381024, while the sum is 46.
The square root of 319472497 is about 17873.7935816659. The cubic root of 319472497 is about 683.6143313628.
The spelling of 319472497 in words is "three hundred nineteen million, four hundred seventy-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •