Base | Representation |
---|---|
bin | 100111110000101011… |
… | …101101100111011111 |
3 | 11002012022211200202002 |
4 | 213300223231213133 |
5 | 1144413312242133 |
6 | 31340204352515 |
7 | 3040651635020 |
oct | 476053554737 |
9 | 132168750662 |
10 | 42692696543 |
11 | 17118a06892 |
12 | 833584573b |
13 | 4044bac923 |
14 | 20d005cc47 |
15 | 119d0c7ce8 |
hex | 9f0aed9df |
42692696543 has 8 divisors (see below), whose sum is σ = 48798398112. Its totient is φ = 36588681216.
The previous prime is 42692696537. The next prime is 42692696549. The reversal of 42692696543 is 34569629624.
It is an interprime number because it is at equal distance from previous prime (42692696537) and next prime (42692696549).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42692696543 - 224 = 42675919327 is a prime.
It is a super-2 number, since 2×426926965432 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42692696549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 366830 + ... + 468987.
It is an arithmetic number, because the mean of its divisors is an integer number (6099799764).
Almost surely, 242692696543 is an apocalyptic number.
42692696543 is a deficient number, since it is larger than the sum of its proper divisors (6105701569).
42692696543 is an equidigital number, since it uses as much as digits as its factorization.
42692696543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843121.
The product of its digits is 16796160, while the sum is 56.
The spelling of 42692696543 in words is "forty-two billion, six hundred ninety-two million, six hundred ninety-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •