Base | Representation |
---|---|
bin | 1000010101111000000… |
… | …0100000001110111110 |
3 | 111200220121010202021201 |
4 | 2011132000200032332 |
5 | 4322000121023402 |
6 | 145500342250114 |
7 | 13232245226305 |
oct | 2053600401676 |
9 | 450817122251 |
10 | 143311111102 |
11 | 558614279a5 |
12 | 2393672693a |
13 | 1068b864833 |
14 | 6d1729b43c |
15 | 3adb76b687 |
hex | 215e0203be |
143311111102 has 32 divisors (see below), whose sum is σ = 237060069120. Its totient is φ = 64673928000.
The previous prime is 143311111061. The next prime is 143311111129. The reversal of 143311111102 is 201111113341.
143311111102 is digitally balanced in base 3, 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 (19).
It is a self number, because there is not a number n which added to its sum of digits gives 143311111102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107263 + ... + 546010.
It is an arithmetic number, because the mean of its divisors is an integer number (7408127160).
Almost surely, 2143311111102 is an apocalyptic number.
143311111102 is a deficient number, since it is larger than the sum of its proper divisors (93748958018).
143311111102 is a wasteful number, since it uses less digits than its factorization.
143311111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 653568.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 143311111102 its reverse (201111113341), we get a palindrome (344422224443).
The spelling of 143311111102 in words is "one hundred forty-three billion, three hundred eleven million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •