Base | Representation |
---|---|
bin | 1100110110100110101101… |
… | …0101001001110001011000 |
3 | 1212001000210022200001012112 |
4 | 3031221223111021301120 |
5 | 3323020313214023000 |
6 | 50020132435531452 |
7 | 2656010105300120 |
oct | 315515325116130 |
9 | 55030708601175 |
10 | 14132243111000 |
11 | 45594a589a263 |
12 | 1702b0b759b88 |
13 | 7b68847729a1 |
14 | 36c00b7d7c80 |
15 | 19792ab47235 |
hex | cda6b549c58 |
14132243111000 has 128 divisors (see below), whose sum is σ = 39782796019200. Its totient is φ = 4590322531200.
The previous prime is 14132243110991. The next prime is 14132243111011. The reversal of 14132243111000 is 11134223141.
14132243111000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 52995734 + ... + 53261733.
It is an arithmetic number, because the mean of its divisors is an integer number (310803093900).
Almost surely, 214132243111000 is an apocalyptic number.
14132243111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14132243111000 is an abundant number, since it is smaller than the sum of its proper divisors (25650552908200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14132243111000 is a wasteful number, since it uses less digits than its factorization.
14132243111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106257514 (or 106257500 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14132243111000 its reverse (11134223141), we get a palindrome (14143377334141).
The spelling of 14132243111000 in words is "fourteen trillion, one hundred thirty-two billion, two hundred forty-three million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •