Base | Representation |
---|---|
bin | 1101001000000011111011… |
… | …0001101111011000110110 |
3 | 1220002200212212212020101112 |
4 | 3102000332301233120312 |
5 | 3342424012143403420 |
6 | 50410011330355022 |
7 | 3016454652216245 |
oct | 322007661573066 |
9 | 56080785766345 |
10 | 14432143341110 |
11 | 4664701741a00 |
12 | 175106772ba72 |
13 | 808c39a0b751 |
14 | 37c73b5a895c |
15 | 1a062e6998c5 |
hex | d203ec6f636 |
14432143341110 has 24 divisors (see below), whose sum is σ = 28554174513648. Its totient is φ = 5248052123600.
The previous prime is 14432143341107. The next prime is 14432143341131. The reversal of 14432143341110 is 1114334123441.
It is a happy number.
It is a super-2 number, since 2×144321433411102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5963694386 + ... + 5963696805.
It is an arithmetic number, because the mean of its divisors is an integer number (1189757271402).
Almost surely, 214432143341110 is an apocalyptic number.
14432143341110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14432143341110 is a deficient number, since it is larger than the sum of its proper divisors (14122031172538).
14432143341110 is a wasteful number, since it uses less digits than its factorization.
14432143341110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11927391220 (or 11927391209 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 14432143341110 its reverse (1114334123441), we get a palindrome (15546477464551).
The spelling of 14432143341110 in words is "fourteen trillion, four hundred thirty-two billion, one hundred forty-three million, three hundred forty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •