Base | Representation |
---|---|
bin | 1000010010010010111… |
… | …0101000010111110011 |
3 | 111121102121212120112111 |
4 | 2010210232220113303 |
5 | 4313013112441111 |
6 | 145221133110151 |
7 | 13166366044216 |
oct | 2044456502763 |
9 | 447377776474 |
10 | 142350124531 |
11 | 55408a3051a |
12 | 23708928357 |
13 | 10567737124 |
14 | 6c657c777d |
15 | 3a821e4a21 |
hex | 2124ba85f3 |
142350124531 has 24 divisors (see below), whose sum is σ = 151186089600. Its totient is φ = 133888377600.
The previous prime is 142350124519. The next prime is 142350124547. The reversal of 142350124531 is 135421053241.
It is not a de Polignac number, because 142350124531 - 27 = 142350124403 is a prime.
It is a super-2 number, since 2×1423501245312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142350124493 and 142350124502.
It is not an unprimeable number, because it can be changed into a prime (142350124031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73036545 + ... + 73038493.
It is an arithmetic number, because the mean of its divisors is an integer number (6299420400).
Almost surely, 2142350124531 is an apocalyptic number.
142350124531 is a deficient number, since it is larger than the sum of its proper divisors (8835965069).
142350124531 is a wasteful number, since it uses less digits than its factorization.
142350124531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3775 (or 3738 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 142350124531 its reverse (135421053241), we get a palindrome (277771177772).
The spelling of 142350124531 in words is "one hundred forty-two billion, three hundred fifty million, one hundred twenty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •