Base | Representation |
---|---|
bin | 11011111001010… |
… | …101001110110100 |
3 | 1012121122120112000 |
4 | 123321111032310 |
5 | 1424302422004 |
6 | 114235055300 |
7 | 14412024213 |
oct | 3371251664 |
9 | 1177576460 |
10 | 468014004 |
11 | 2201aa937 |
12 | 1108a1530 |
13 | 75c66183 |
14 | 4622b07a |
15 | 2b14ac39 |
hex | 1be553b4 |
468014004 has 48 divisors (see below), whose sum is σ = 1277236800. Its totient is φ = 147793248.
The previous prime is 468013981. The next prime is 468014077. The reversal of 468014004 is 400410864.
It is a super-2 number, since 2×4680140042 = 438074215880224032, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 111987 + ... + 116090.
It is an arithmetic number, because the mean of its divisors is an integer number (26609100).
Almost surely, 2468014004 is an apocalyptic number.
It is an amenable number.
468014004 is an abundant number, since it is smaller than the sum of its proper divisors (809222796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
468014004 is a wasteful number, since it uses less digits than its factorization.
468014004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228109 (or 228101 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 468014004 is about 21633.6313179272. The cubic root of 468014004 is about 776.4013516169.
Adding to 468014004 its reverse (400410864), we get a palindrome (868424868).
It can be divided in two parts, 46801 and 4004, that added together give a palindrome (50805).
The spelling of 468014004 in words is "four hundred sixty-eight million, fourteen thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •