Base | Representation |
---|---|
bin | 11011010001100110… |
… | …11000000000000000 |
3 | 1101210111202122002202 |
4 | 31220303120000000 |
5 | 214442124400000 |
6 | 10421010332332 |
7 | 1025605101122 |
oct | 155063300000 |
9 | 41714678082 |
10 | 14643200000 |
11 | 6234782990 |
12 | 2a07b8a0a8 |
13 | 14c49519b0 |
14 | 9ccaa7212 |
15 | 5aa835dd5 |
hex | 368cd8000 |
14643200000 has 384 divisors, whose sum is σ = 43004591280. Its totient is φ = 4915200000.
The previous prime is 14643199997. The next prime is 14643200017. The reversal of 14643200000 is 234641.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 1126399994 + ... + 1126400006.
Almost surely, 214643200000 is an apocalyptic number.
14643200000 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 14643200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21502295640).
14643200000 is an abundant number, since it is smaller than the sum of its proper divisors (28361391280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14643200000 is an frugal number, since it uses more digits than its factorization.
14643200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79 (or 31 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 14643200000 its reverse (234641), we get a palindrome (14643434641).
The spelling of 14643200000 in words is "fourteen billion, six hundred forty-three million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •