Base | Representation |
---|---|
bin | 10000111100111… |
… | …01000111011001 |
3 | 100220120120112000 |
4 | 20132131013121 |
5 | 242400420210 |
6 | 22035511213 |
7 | 3344456031 |
oct | 1036350731 |
9 | 326516460 |
10 | 142201305 |
11 | 732a5a44 |
12 | 3b758509 |
13 | 235cb2ac |
14 | 14c588c1 |
15 | c73dac0 |
hex | 879d1d9 |
142201305 has 32 divisors (see below), whose sum is σ = 253307520. Its totient is φ = 75689280.
The previous prime is 142201303. The next prime is 142201307. The reversal of 142201305 is 503102241.
It is an interprime number because it is at equal distance from previous prime (142201303) and next prime (142201307).
It is not a de Polignac number, because 142201305 - 21 = 142201303 is a prime.
It is a super-2 number, since 2×1422013052 = 40442422287406050, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (142201303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 110194 + ... + 111476.
It is an arithmetic number, because the mean of its divisors is an integer number (7915860).
Almost surely, 2142201305 is an apocalyptic number.
142201305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142201305 is a deficient number, since it is larger than the sum of its proper divisors (111106215).
142201305 is a wasteful number, since it uses less digits than its factorization.
142201305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2118 (or 2112 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 142201305 is about 11924.8188665489. The cubic root of 142201305 is about 521.9567608523.
Adding to 142201305 its reverse (503102241), we get a palindrome (645303546).
The spelling of 142201305 in words is "one hundred forty-two million, two hundred one thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.369 sec. • engine limits •