Base | Representation |
---|---|
bin | 10010101111101… |
… | …000110001010000 |
3 | 210220202010020022 |
4 | 102233220301100 |
5 | 1121001241043 |
6 | 51112203012 |
7 | 10536005312 |
oct | 2257506120 |
9 | 726663208 |
10 | 314477648 |
11 | 151572791 |
12 | 89399468 |
13 | 501c9764 |
14 | 2daa17b2 |
15 | 1c91d868 |
hex | 12be8c50 |
314477648 has 20 divisors (see below), whose sum is σ = 609985140. Its totient is φ = 157062144.
The previous prime is 314477633. The next prime is 314477651. The reversal of 314477648 is 846774413.
It can be written as a sum of positive squares in 2 ways, for example, as 7246864 + 307230784 = 2692^2 + 17528^2 .
It is a super-2 number, since 2×3144776482 = 197792382183223808, which contains 22 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 314477599 and 314477608.
It is a congruent number.
It is an unprimeable number.
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, 4286 + ... + 25442.
It is an arithmetic number, because the mean of its divisors is an integer number (30499257).
Almost surely, 2314477648 is an apocalyptic number.
It is an amenable number.
314477648 is a deficient number, since it is larger than the sum of its proper divisors (295507492).
314477648 is a wasteful number, since it uses less digits than its factorization.
314477648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22094 (or 22088 counting only the distinct ones).
The product of its digits is 451584, while the sum is 44.
The square root of 314477648 is about 17733.5176431525. The cubic root of 314477648 is about 680.0329049821.
The spelling of 314477648 in words is "three hundred fourteen million, four hundred seventy-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •