Base | Representation |
---|---|
bin | 10011000001101001… |
… | …01000010101000000 |
3 | 222100212002102211001 |
4 | 21200310220111000 |
5 | 131404333002000 |
6 | 4405320501344 |
7 | 511056330400 |
oct | 114064502500 |
9 | 28325072731 |
10 | 10214344000 |
11 | 4371804913 |
12 | 1b9091a854 |
13 | c6a227643 |
14 | 6cc7da800 |
15 | 3ebaec46a |
hex | 260d28540 |
10214344000 has 336 divisors, whose sum is σ = 29921508864. Its totient is φ = 3443328000.
The previous prime is 10214343989. The next prime is 10214344001. The reversal of 10214344000 is 44341201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10214344001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 27831817 + ... + 27832183.
Almost surely, 210214344000 is an apocalyptic number.
10214344000 is a gapful number since it is divisible by the number (10) 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 10214344000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14960754432).
10214344000 is an abundant number, since it is smaller than the sum of its proper divisors (19707164864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10214344000 is an equidigital number, since it uses as much as digits as its factorization.
10214344000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 452 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 10214344000 its reverse (44341201), we get a palindrome (10258685201).
The spelling of 10214344000 in words is "ten billion, two hundred fourteen million, three hundred forty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •