Base | Representation |
---|---|
bin | 11011000100010111… |
… | …01100100110000100 |
3 | 1101111202202221222100 |
4 | 31202023230212010 |
5 | 214230211312200 |
6 | 10402002032100 |
7 | 1023056053254 |
oct | 154213544604 |
9 | 41452687870 |
10 | 14532135300 |
11 | 6188014381 |
12 | 2996948630 |
13 | 14a7935b37 |
14 | 9bc035964 |
15 | 5a0be7d00 |
hex | 3622ec984 |
14532135300 has 108 divisors (see below), whose sum is σ = 45594581760. Its totient is φ = 3871458240.
The previous prime is 14532135283. The next prime is 14532135323. The reversal of 14532135300 is 353123541.
14532135300 is a `hidden beast` number, since 1 + 4 + 5 + 321 + 35 + 300 = 666.
It is a super-2 number, since 2×145321353002 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 985381 + ... + 1000019.
Almost surely, 214532135300 is an apocalyptic number.
14532135300 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 14532135300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22797290880).
14532135300 is an abundant number, since it is smaller than the sum of its proper divisors (31062446460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14532135300 is a wasteful number, since it uses less digits than its factorization.
14532135300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15762 (or 15752 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 14532135300 its reverse (353123541), we get a palindrome (14885258841).
The spelling of 14532135300 in words is "fourteen billion, five hundred thirty-two million, one hundred thirty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •