| Base | Representation |
|---|---|
| bin | 11001111111000000… |
| … | …01010111101100000 |
| 3 | 1100000012221122222210 |
| 4 | 30333200022331200 |
| 5 | 212032234100000 |
| 6 | 10224135202120 |
| 7 | 1002462410400 |
| oct | 147740127540 |
| 9 | 40005848883 |
| 10 | 13950300000 |
| 11 | 5a0964295a |
| 12 | 2853b16340 |
| 13 | 141422a1b0 |
| 14 | 964a5a800 |
| 15 | 569ab7350 |
| hex | 33f80af60 |
13950300000 has 864 divisors, whose sum is σ = 58125592224. Its totient is φ = 2903040000.
The previous prime is 13950299999. The next prime is 13950300037. The reversal of 13950300000 is 305931.
13950300000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×139503000002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 13950300000.
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 143 ways as a sum of consecutive naturals, for example, 191099964 + ... + 191100036.
It is an arithmetic number, because the mean of its divisors is an integer number (67274991).
Almost surely, 213950300000 is an apocalyptic number.
13950300000 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 13950300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29062796112).
13950300000 is an abundant number, since it is smaller than the sum of its proper divisors (44175292224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13950300000 is an equidigital number, since it uses as much as digits as its factorization.
13950300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138 (or 103 counting only the distinct ones).
The product of its (nonzero) digits is 405, while the sum is 21.
Adding to 13950300000 its reverse (305931), we get a palindrome (13950605931).
The spelling of 13950300000 in words is "thirteen billion, nine hundred fifty million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •