Base | Representation |
---|---|
bin | 10000111011011… |
… | …11001001010101 |
3 | 100220020000020020 |
4 | 20131233021111 |
5 | 242323404023 |
6 | 22031455353 |
7 | 3343043052 |
oct | 1035571125 |
9 | 326200206 |
10 | 142013013 |
11 | 7318752a |
12 | 3b687559 |
13 | 2356368c |
14 | 14c0a029 |
15 | c702de3 |
hex | 876f255 |
142013013 has 4 divisors (see below), whose sum is σ = 189350688. Its totient is φ = 94675340.
The previous prime is 142013009. The next prime is 142013021. The reversal of 142013013 is 310310241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 142013013 - 22 = 142013009 is a prime.
It is a super-2 number, since 2×1420130132 = 40335391722676338, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 142012983 and 142013001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142013213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23668833 + ... + 23668838.
It is an arithmetic number, because the mean of its divisors is an integer number (47337672).
Almost surely, 2142013013 is an apocalyptic number.
It is an amenable number.
142013013 is a deficient number, since it is larger than the sum of its proper divisors (47337675).
142013013 is an equidigital number, since it uses as much as digits as its factorization.
142013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47337674.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 142013013 is about 11916.9212886551. The cubic root of 142013013 is about 521.7262807998.
Adding to 142013013 its reverse (310310241), we get a palindrome (452323254).
The spelling of 142013013 in words is "one hundred forty-two million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •