Base | Representation |
---|---|
bin | 10011010010010110000111… |
… | …11110101011100101010101 |
3 | 12120011112020220211211111202 |
4 | 21221023003332223211111 |
5 | 21024333324014204034 |
6 | 230111413142442245 |
7 | 11635102550634623 |
oct | 1151130376534525 |
9 | 176145226754452 |
10 | 42411795069269 |
11 | 1257181770938a |
12 | 490b834433385 |
13 | 1a8855200c2a2 |
14 | a68a55842513 |
15 | 4d8364d8347e |
hex | 2692c3fab955 |
42411795069269 has 4 divisors (see below), whose sum is σ = 42411993100800. Its totient is φ = 42411597037740.
The previous prime is 42411795069223. The next prime is 42411795069277. The reversal of 42411795069269 is 96296059711424.
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 42411795069269 - 28 = 42411795069013 is a prime.
It is a super-2 number, since 2×424117950692692 (a number of 28 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 (42411795069869) 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, 98694167 + ... + 99122964.
It is an arithmetic number, because the mean of its divisors is an integer number (10602998275200).
Almost surely, 242411795069269 is an apocalyptic number.
It is an amenable number.
42411795069269 is a deficient number, since it is larger than the sum of its proper divisors (198031531).
42411795069269 is a wasteful number, since it uses less digits than its factorization.
42411795069269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198031530.
The product of its (nonzero) digits is 58786560, while the sum is 65.
The spelling of 42411795069269 in words is "forty-two trillion, four hundred eleven billion, seven hundred ninety-five million, sixty-nine thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •