Base | Representation |
---|---|
bin | 1100110110011110110101… |
… | …1111111101100101010000 |
3 | 1212000211100012021021112002 |
4 | 3031213231133331211100 |
5 | 3323002002243443230 |
6 | 50015143143453132 |
7 | 2655603562261430 |
oct | 315475537754520 |
9 | 55024305237462 |
10 | 14130132015440 |
11 | 4558612172991 |
12 | 17026207571a8 |
13 | 7b660929b70c |
14 | 36bc8b2a02c0 |
15 | 19785563c545 |
hex | cd9ed7fd950 |
14130132015440 has 160 divisors (see below), whose sum is σ = 37677474392064. Its totient is φ = 4827639398400.
The previous prime is 14130132015437. The next prime is 14130132015463. The reversal of 14130132015440 is 4451023103141.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 368173532 + ... + 368211908.
Almost surely, 214130132015440 is an apocalyptic number.
14130132015440 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 14130132015440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18838737196032).
14130132015440 is an abundant number, since it is smaller than the sum of its proper divisors (23547342376624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14130132015440 is a wasteful number, since it uses less digits than its factorization.
14130132015440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40685 (or 40679 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 14130132015440 its reverse (4451023103141), we get a palindrome (18581155118581).
The spelling of 14130132015440 in words is "fourteen trillion, one hundred thirty billion, one hundred thirty-two million, fifteen thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •