Base | Representation |
---|---|
bin | 11000110101101000… |
… | …01100101111110000 |
3 | 1021102022202200101122 |
4 | 30122310030233300 |
5 | 204302201340300 |
6 | 10043110521412 |
7 | 651306605051 |
oct | 143264145760 |
9 | 37368680348 |
10 | 13334793200 |
11 | 5723163553 |
12 | 2701966268 |
13 | 13468623a1 |
14 | 906dd8728 |
15 | 530a34c85 |
hex | 31ad0cbf0 |
13334793200 has 120 divisors (see below), whose sum is σ = 34387316928. Its totient is φ = 4951203840.
The previous prime is 13334793181. The next prime is 13334793221. The reversal of 13334793200 is 239743331.
13334793200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 482969 + ... + 509831.
Almost surely, 213334793200 is an apocalyptic number.
13334793200 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 13334793200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17193658464).
13334793200 is an abundant number, since it is smaller than the sum of its proper divisors (21052523728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13334793200 is a wasteful number, since it uses less digits than its factorization.
13334793200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26971 (or 26960 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 35.
The spelling of 13334793200 in words is "thirteen billion, three hundred thirty-four million, seven hundred ninety-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •