Base | Representation |
---|---|
bin | 11100010101001… |
… | …010101001001100 |
3 | 1020010101021122211 |
4 | 130111022221030 |
5 | 1433134420133 |
6 | 115055320204 |
7 | 14531034250 |
oct | 3425125114 |
9 | 1203337584 |
10 | 475310668 |
11 | 224333a38 |
12 | 113220064 |
13 | 7761c421 |
14 | 471aa260 |
15 | 2badcbcd |
hex | 1c54aa4c |
475310668 has 24 divisors (see below), whose sum is σ = 954422784. Its totient is φ = 202890000.
The previous prime is 475310653. The next prime is 475310681. The reversal of 475310668 is 866013574.
It is a happy number.
It is a super-2 number, since 2×4753106682 = 451840462229212448, which contains 22 as substring.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 475310668.
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 7 ways as a sum of consecutive naturals, for example, 26788 + ... + 40843.
It is an arithmetic number, because the mean of its divisors is an integer number (39767616).
Almost surely, 2475310668 is an apocalyptic number.
It is an amenable number.
475310668 is an abundant number, since it is smaller than the sum of its proper divisors (479112116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
475310668 is a wasteful number, since it uses less digits than its factorization.
475310668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67893 (or 67891 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 40.
The square root of 475310668 is about 21801.6207654385. The cubic root of 475310668 is about 780.4154416303.
The spelling of 475310668 in words is "four hundred seventy-five million, three hundred ten thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •