Base | Representation |
---|---|
bin | 1001001110010111111111… |
… | …0100101110010110110011 |
3 | 1022220121201121101011010011 |
4 | 2103211333310232112303 |
5 | 2312133431423014101 |
6 | 33323232342115351 |
7 | 2064530102123635 |
oct | 223457764562663 |
9 | 38817647334104 |
10 | 10142562313651 |
11 | 3260489012349 |
12 | 117984371bb57 |
13 | 587593826a31 |
14 | 270c8cb8ca55 |
15 | 128c70a9d751 |
hex | 9397fd2e5b3 |
10142562313651 has 4 divisors (see below), whose sum is σ = 10143509253904. Its totient is φ = 10141615373400.
The previous prime is 10142562313613. The next prime is 10142562313687. The reversal of 10142562313651 is 15631326524101.
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 10142562313651 - 237 = 10005123360179 is a prime.
It is a super-2 number, since 2×101425623136512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10142562313691) 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, 473454060 + ... + 473475481.
It is an arithmetic number, because the mean of its divisors is an integer number (2535877313476).
Almost surely, 210142562313651 is an apocalyptic number.
10142562313651 is a deficient number, since it is larger than the sum of its proper divisors (946940253).
10142562313651 is an equidigital number, since it uses as much as digits as its factorization.
10142562313651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946940252.
The product of its (nonzero) digits is 129600, while the sum is 40.
Adding to 10142562313651 its reverse (15631326524101), we get a palindrome (25773888837752).
The spelling of 10142562313651 in words is "ten trillion, one hundred forty-two billion, five hundred sixty-two million, three hundred thirteen thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •