Base | Representation |
---|---|
bin | 101011100111010… |
… | …1011000001000000 |
3 | 10202222202200012101 |
4 | 1113032223001000 |
5 | 10444121322000 |
6 | 401115040144 |
7 | 51160144615 |
oct | 12716530100 |
9 | 3688680171 |
10 | 1463464000 |
11 | 6910a6189 |
12 | 34a140054 |
13 | 1a426c33b |
14 | dc51250c |
15 | 8872de6a |
hex | 573ab040 |
1463464000 has 56 divisors (see below), whose sum is σ = 3624288408. Its totient is φ = 585382400.
The previous prime is 1463463983. The next prime is 1463464001. The reversal of 1463464000 is 4643641.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 137921536 + 1325542464 = 11744^2 + 36408^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1463464000.
It is not an unprimeable number, because it can be changed into a prime (1463464001) 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 7 ways as a sum of consecutive naturals, for example, 83467 + ... + 99466.
Almost surely, 21463464000 is an apocalyptic number.
1463464000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1463464000 is an abundant number, since it is smaller than the sum of its proper divisors (2160824408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1463464000 is an equidigital number, since it uses as much as digits as its factorization.
1463464000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182960 (or 182940 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 1463464000 is about 38255.2480059926. The cubic root of 1463464000 is about 1135.3436829146.
The spelling of 1463464000 in words is "one billion, four hundred sixty-three million, four hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •