Base | Representation |
---|---|
bin | 11000111101011001… |
… | …11100110111010000 |
3 | 1021120212110122001101 |
4 | 30132230330313100 |
5 | 204420400031000 |
6 | 10053400314144 |
7 | 653031065140 |
oct | 143654746720 |
9 | 37525418041 |
10 | 13400002000 |
11 | 5756a51920 |
12 | 271b772954 |
13 | 1357214188 |
14 | 911930920 |
15 | 536615e6a |
hex | 31eb3cdd0 |
13400002000 has 160 divisors (see below), whose sum is σ = 40396771584. Its totient is φ = 4176576000.
The previous prime is 13400001991. The next prime is 13400002019. The reversal of 13400002000 is 20000431.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 31 ways as a sum of consecutive naturals, for example, 110494 + ... + 197506.
Almost surely, 213400002000 is an apocalyptic number.
13400002000 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 13400002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20198385792).
13400002000 is an abundant number, since it is smaller than the sum of its proper divisors (26996769584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13400002000 is a wasteful number, since it uses less digits than its factorization.
13400002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87054 (or 87038 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
Adding to 13400002000 its reverse (20000431), we get a palindrome (13420002431).
The spelling of 13400002000 in words is "thirteen billion, four hundred million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •