Base | Representation |
---|---|
bin | 10000111011100… |
… | …00001101100101 |
3 | 100220020020020000 |
4 | 20131300031211 |
5 | 242324024011 |
6 | 22031531513 |
7 | 3343061562 |
oct | 1035601545 |
9 | 326206200 |
10 | 142017381 |
11 | 7318a840 |
12 | 3b689b99 |
13 | 2356566c |
14 | 14c0b869 |
15 | c704356 |
hex | 8770365 |
142017381 has 40 divisors (see below), whose sum is σ = 243645600. Its totient is φ = 81531360.
The previous prime is 142017377. The next prime is 142017397. The reversal of 142017381 is 183710241.
It is not a de Polignac number, because 142017381 - 22 = 142017377 is a prime.
It is a super-2 number, since 2×1420173812 = 40337873012198322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142017311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 12735 + ... + 21123.
It is an arithmetic number, because the mean of its divisors is an integer number (6091140).
Almost surely, 2142017381 is an apocalyptic number.
142017381 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142017381 is a deficient number, since it is larger than the sum of its proper divisors (101628219).
142017381 is a wasteful number, since it uses less digits than its factorization.
142017381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8431 (or 8422 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
The square root of 142017381 is about 11917.1045560572. The cubic root of 142017381 is about 521.7316297862.
The spelling of 142017381 in words is "one hundred forty-two million, seventeen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •