Base | Representation |
---|---|
bin | 11010001011010011… |
… | …11110000111100010 |
3 | 1100021102012101212000 |
4 | 31011221332013202 |
5 | 212240201012010 |
6 | 10242303544430 |
7 | 1005155023611 |
oct | 150551760742 |
9 | 40242171760 |
10 | 14053532130 |
11 | 5a61941770 |
12 | 28825bb116 |
13 | 142c732bb1 |
14 | 97464d878 |
15 | 573ba97c0 |
hex | 345a7e1e2 |
14053532130 has 128 divisors (see below), whose sum is σ = 40937840640. Its totient is φ = 3402348480.
The previous prime is 14053532123. The next prime is 14053532159. The reversal of 14053532130 is 3123535041.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 14053532094 and 14053532103.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2560369 + ... + 2565851.
It is an arithmetic number, because the mean of its divisors is an integer number (319826880).
Almost surely, 214053532130 is an apocalyptic number.
14053532130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14053532130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20468920320).
14053532130 is an abundant number, since it is smaller than the sum of its proper divisors (26884308510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14053532130 is a wasteful number, since it uses less digits than its factorization.
14053532130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6373 (or 6367 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The spelling of 14053532130 in words is "fourteen billion, fifty-three million, five hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •