Base | Representation |
---|---|
bin | 100111010111010000… |
… | …100111111110010101 |
3 | 11001002121020122122202 |
4 | 213113100213332111 |
5 | 1143030114241031 |
6 | 31230010334245 |
7 | 3024252322154 |
oct | 472720477625 |
9 | 131077218582 |
10 | 42266165141 |
11 | 16a1a16a4a2 |
12 | 8236a2a385 |
13 | 3ca770c095 |
14 | 208d54d59b |
15 | 11759232cb |
hex | 9d7427f95 |
42266165141 has 4 divisors (see below), whose sum is σ = 42292934400. Its totient is φ = 42239395884.
The previous prime is 42266165129. The next prime is 42266165177. The reversal of 42266165141 is 14156166224.
It is a happy number.
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 42266165141 - 26 = 42266165077 is a prime.
It is a super-3 number, since 3×422661651413 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42266165095 and 42266165104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42266165191) 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, 13382261 + ... + 13385418.
It is an arithmetic number, because the mean of its divisors is an integer number (10573233600).
Almost surely, 242266165141 is an apocalyptic number.
It is an amenable number.
42266165141 is a deficient number, since it is larger than the sum of its proper divisors (26769259).
42266165141 is a wasteful number, since it uses less digits than its factorization.
42266165141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26769258.
The product of its digits is 69120, while the sum is 38.
The spelling of 42266165141 in words is "forty-two billion, two hundred sixty-six million, one hundred sixty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •