Base | Representation |
---|---|
bin | 1100110110011110100000… |
… | …0110110110000110010110 |
3 | 1212000211002220000220120010 |
4 | 3031213220012312012112 |
5 | 3323001311113420420 |
6 | 50015130152421050 |
7 | 2655601413266511 |
oct | 315475006660626 |
9 | 55024086026503 |
10 | 14130041545110 |
11 | 45585760a0217 |
12 | 17025b63a7786 |
13 | 7b65c361368a |
14 | 36bc7d26dd78 |
15 | 19784c71b4e0 |
hex | cd9e81b6196 |
14130041545110 has 64 divisors (see below), whose sum is σ = 34245559116288. Its totient is φ = 3730969042944.
The previous prime is 14130041545097. The next prime is 14130041545133. The reversal of 14130041545110 is 1154514003141.
14130041545110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 25193494 + ... + 25748246.
It is an arithmetic number, because the mean of its divisors is an integer number (535086861192).
Almost surely, 214130041545110 is an apocalyptic number.
14130041545110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14130041545110 is an abundant number, since it is smaller than the sum of its proper divisors (20115517571178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14130041545110 is a wasteful number, since it uses less digits than its factorization.
14130041545110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 563109.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 14130041545110 its reverse (1154514003141), we get a palindrome (15284555548251).
The spelling of 14130041545110 in words is "fourteen trillion, one hundred thirty billion, forty-one million, five hundred forty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •