Base | Representation |
---|---|
bin | 1000010111110001010… |
… | …1110000110000110111 |
3 | 111202020001201000001012 |
4 | 2011330111300300313 |
5 | 4324020410002221 |
6 | 150023041422435 |
7 | 13250664555311 |
oct | 2057425606067 |
9 | 452201630035 |
10 | 143820000311 |
11 | 55aa2705999 |
12 | 23a5903aa1b |
13 | 1074010ca00 |
14 | 6d64ac87b1 |
15 | 3b1b28d65b |
hex | 217c570c37 |
143820000311 has 12 divisors (see below), whose sum is σ = 156524647752. Its totient is φ = 132082999776.
The previous prime is 143820000301. The next prime is 143820000377. The reversal of 143820000311 is 113000028341.
143820000311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 143820000311 - 210 = 143819999287 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143820000301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2126621 + ... + 2193206.
It is an arithmetic number, because the mean of its divisors is an integer number (13043720646).
Almost surely, 2143820000311 is an apocalyptic number.
143820000311 is a deficient number, since it is larger than the sum of its proper divisors (12704647441).
143820000311 is a wasteful number, since it uses less digits than its factorization.
143820000311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4320050 (or 4320037 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 143820000311 its reverse (113000028341), we get a palindrome (256820028652).
The spelling of 143820000311 in words is "one hundred forty-three billion, eight hundred twenty million, three hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •