Base | Representation |
---|---|
bin | 1100110111010000010111… |
… | …0000110111010001010110 |
3 | 1212002002122112111010000122 |
4 | 3031310011300313101112 |
5 | 3323211213021013420 |
6 | 50025222125111542 |
7 | 2656554142266305 |
oct | 315640560672126 |
9 | 55062575433018 |
10 | 14143424001110 |
11 | 4563213148508 |
12 | 17051100b85b2 |
13 | 7b7946cc33b1 |
14 | 36c78c71443c |
15 | 197d82518725 |
hex | cdd05c37456 |
14143424001110 has 16 divisors (see below), whose sum is σ = 25626760312032. Its totient is φ = 5619903576000.
The previous prime is 14143424001103. The next prime is 14143424001127. The reversal of 14143424001110 is 1110042434141.
It is a happy number.
14143424001110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 14143424001110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4683251471 + ... + 4683254490.
It is an arithmetic number, because the mean of its divisors is an integer number (1601672519502).
Almost surely, 214143424001110 is an apocalyptic number.
14143424001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14143424001110 is a deficient number, since it is larger than the sum of its proper divisors (11483336310922).
14143424001110 is a wasteful number, since it uses less digits than its factorization.
14143424001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9366506119.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 14143424001110 its reverse (1110042434141), we get a palindrome (15253466435251).
The spelling of 14143424001110 in words is "fourteen trillion, one hundred forty-three billion, four hundred twenty-four million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •