Base | Representation |
---|---|
bin | 11010000101100010… |
… | …10101010000111100 |
3 | 1100011001010100000122 |
4 | 31002301111100330 |
5 | 212140303132200 |
6 | 10233414314112 |
7 | 1004026433450 |
oct | 150261252074 |
9 | 40131110018 |
10 | 14005130300 |
11 | 5a37592757 |
12 | 286a358938 |
13 | 14226b7065 |
14 | 96c050660 |
15 | 56e7e8385 |
hex | 342c5543c |
14005130300 has 144 divisors (see below), whose sum is σ = 35793667392. Its totient is φ = 4657305600.
The previous prime is 14005130291. The next prime is 14005130303. The reversal of 14005130300 is 303150041.
It is a super-2 number, since 2×140051303002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14005130303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3114854 + ... + 3119346.
Almost surely, 214005130300 is an apocalyptic number.
14005130300 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 14005130300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17896833696).
14005130300 is an abundant number, since it is smaller than the sum of its proper divisors (21788537092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14005130300 is a wasteful number, since it uses less digits than its factorization.
14005130300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4648 (or 4641 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 17.
Adding to 14005130300 its reverse (303150041), we get a palindrome (14308280341).
The spelling of 14005130300 in words is "fourteen billion, five million, one hundred thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •