Base | Representation |
---|---|
bin | 10011010010010100111000… |
… | …10110000010100110101001 |
3 | 12120011110112120121002222002 |
4 | 21221022130112002212221 |
5 | 21024330443301313413 |
6 | 230111223150140345 |
7 | 11635050224552222 |
oct | 1151123426024651 |
9 | 176143476532862 |
10 | 42411130104233 |
11 | 12571506319300 |
12 | 490b6897b16b5 |
13 | 1a88477318857 |
14 | a689d13c8249 |
15 | 4d83267d1958 |
hex | 26929c5829a9 |
42411130104233 has 12 divisors (see below), whose sum is σ = 47273772780864. Its totient is φ = 38012536577400.
The previous prime is 42411130104191. The next prime is 42411130104257. The reversal of 42411130104233 is 33240103111424.
It is not a de Polignac number, because 42411130104233 - 26 = 42411130104169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42411130104196 and 42411130104205.
It is not an unprimeable number, because it can be changed into a prime (42411130104433) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2468337941 + ... + 2468355122.
It is an arithmetic number, because the mean of its divisors is an integer number (3939481065072).
Almost surely, 242411130104233 is an apocalyptic number.
It is an amenable number.
42411130104233 is a deficient number, since it is larger than the sum of its proper divisors (4862642676631).
42411130104233 is a wasteful number, since it uses less digits than its factorization.
42411130104233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4936693156 (or 4936693145 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 42411130104233 its reverse (33240103111424), we get a palindrome (75651233215657).
The spelling of 42411130104233 in words is "forty-two trillion, four hundred eleven billion, one hundred thirty million, one hundred four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •