Base | Representation |
---|---|
bin | 11011111001101… |
… | …011101111011000 |
3 | 1012121211020222200 |
4 | 123321223233120 |
5 | 1424313344300 |
6 | 114241050200 |
7 | 14412560052 |
oct | 3371535730 |
9 | 1177736880 |
10 | 468106200 |
11 | 220263131 |
12 | 110926960 |
13 | 75c99123 |
14 | 462528d2 |
15 | 2b168200 |
hex | 1be6bbd8 |
468106200 has 144 divisors (see below), whose sum is σ = 1622961600. Its totient is φ = 120787200.
The previous prime is 468106183. The next prime is 468106217. The reversal of 468106200 is 2601864.
It is an interprime number because it is at equal distance from previous prime (468106183) and next prime (468106217).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 51606 + ... + 59994.
Almost surely, 2468106200 is an apocalyptic number.
468106200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 468106200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (811480800).
468106200 is an abundant number, since it is smaller than the sum of its proper divisors (1154855400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
468106200 is a wasteful number, since it uses less digits than its factorization.
468106200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8442 (or 8430 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 468106200 is about 21635.7620619196. The cubic root of 468106200 is about 776.4523304328.
The spelling of 468106200 in words is "four hundred sixty-eight million, one hundred six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •