Base | Representation |
---|---|
bin | 1000010001000001001… |
… | …0101100101010010011 |
3 | 111120112201201010201201 |
4 | 2010100102230222103 |
5 | 4311312324221442 |
6 | 145123124212031 |
7 | 13155033526465 |
oct | 2042022545223 |
9 | 446481633651 |
10 | 142007257747 |
11 | 55252438643 |
12 | 23631b3a017 |
13 | 105116aa984 |
14 | 6c32056135 |
15 | 3a620697b7 |
hex | 21104aca93 |
142007257747 has 4 divisors (see below), whose sum is σ = 142057316016. Its totient is φ = 141957199480.
The previous prime is 142007257729. The next prime is 142007257759. The reversal of 142007257747 is 747752700241.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 142007257747 - 27 = 142007257619 is a prime.
It is a super-2 number, since 2×1420072577472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 142007257697 and 142007257706.
It is not an unprimeable number, because it can be changed into a prime (142007257727) 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, 25024879 + ... + 25030552.
It is an arithmetic number, because the mean of its divisors is an integer number (35514329004).
Almost surely, 2142007257747 is an apocalyptic number.
142007257747 is a deficient number, since it is larger than the sum of its proper divisors (50058269).
142007257747 is an equidigital number, since it uses as much as digits as its factorization.
142007257747 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50058268.
The product of its (nonzero) digits is 768320, while the sum is 46.
Adding to 142007257747 its reverse (747752700241), we get a palindrome (889759957988).
The spelling of 142007257747 in words is "one hundred forty-two billion, seven million, two hundred fifty-seven thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •