Base | Representation |
---|---|
bin | 11011100111000… |
… | …100000010101100 |
3 | 1012021122021020122 |
4 | 123213010002230 |
5 | 1422041200004 |
6 | 113544304112 |
7 | 14323230134 |
oct | 3347040254 |
9 | 1167567218 |
10 | 463225004 |
11 | 218529890 |
12 | 10b172038 |
13 | 74c7a448 |
14 | 45741ac4 |
15 | 2aa01cbe |
hex | 1b9c40ac |
463225004 has 48 divisors (see below), whose sum is σ = 927551520. Its totient is φ = 200471040.
The previous prime is 463225003. The next prime is 463225013. The reversal of 463225004 is 400522364.
It is a super-3 number, since 3×4632250043 (a number of 27 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (463225003) 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 15 ways as a sum of consecutive naturals, for example, 90662 + ... + 95634.
It is an arithmetic number, because the mean of its divisors is an integer number (19323990).
Almost surely, 2463225004 is an apocalyptic number.
463225004 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
463225004 is an abundant number, since it is smaller than the sum of its proper divisors (464326516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
463225004 is a wasteful number, since it uses less digits than its factorization.
463225004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5090 (or 5088 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
The square root of 463225004 is about 21522.6625676286. The cubic root of 463225004 is about 773.7440658171.
Adding to 463225004 its reverse (400522364), we get a palindrome (863747368).
The spelling of 463225004 in words is "four hundred sixty-three million, two hundred twenty-five thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •