Base | Representation |
---|---|
bin | 10000111110010… |
… | …01001000100101 |
3 | 100220220201211210 |
4 | 20133021020211 |
5 | 242422202410 |
6 | 22043422033 |
7 | 3346136502 |
oct | 1037111045 |
9 | 326821753 |
10 | 142381605 |
11 | 73409453 |
12 | 3b824919 |
13 | 23662392 |
14 | 14ca44a9 |
15 | c777220 |
hex | 87c9225 |
142381605 has 32 divisors (see below), whose sum is σ = 237109248. Its totient is φ = 72878400.
The previous prime is 142381597. The next prime is 142381607. The reversal of 142381605 is 506183241.
It is not a de Polignac number, because 142381605 - 23 = 142381597 is a prime.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a nialpdrome in base 15.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142381607) 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, 57850 + ... + 60260.
It is an arithmetic number, because the mean of its divisors is an integer number (7409664).
Almost surely, 2142381605 is an apocalyptic number.
142381605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142381605 is a deficient number, since it is larger than the sum of its proper divisors (94727643).
142381605 is a wasteful number, since it uses less digits than its factorization.
142381605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2577.
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 142381605 is about 11932.3763349971. The cubic root of 142381605 is about 522.1772676374.
It can be divided in two parts, 1423 and 81605, that added together give a triangular number (83028 = T407).
The spelling of 142381605 in words is "one hundred forty-two million, three hundred eighty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •