Base | Representation |
---|---|
bin | 10011010010000101111111… |
… | …00111101111001011011001 |
3 | 12120010200220011202212222010 |
4 | 21221002333213233023121 |
5 | 21024213103243324400 |
6 | 230103421355220133 |
7 | 11634345066103626 |
oct | 1151027747571331 |
9 | 176120804685863 |
10 | 42403132011225 |
11 | 12569081633687 |
12 | 490a017147649 |
13 | 1a877a12c273b |
14 | a6847309934d |
15 | 4d8009561450 |
hex | 2690bf9ef2d9 |
42403132011225 has 24 divisors (see below), whose sum is σ = 70106930573632. Its totient is φ = 22614868584000.
The previous prime is 42403132011223. The next prime is 42403132011269. The reversal of 42403132011225 is 52211023130424.
It is a happy number.
It is not a de Polignac number, because 42403132011225 - 21 = 42403132011223 is a prime.
It is a super-2 number, since 2×424031320112252 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42403132011192 and 42403132011201.
It is not an unprimeable number, because it can be changed into a prime (42403132011223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11640159 + ... + 14842491.
Almost surely, 242403132011225 is an apocalyptic number.
It is an amenable number.
42403132011225 is a deficient number, since it is larger than the sum of its proper divisors (27703798562407).
42403132011225 is a wasteful number, since it uses less digits than its factorization.
42403132011225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3378897 (or 3378892 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 42403132011225 its reverse (52211023130424), we get a palindrome (94614155141649).
The spelling of 42403132011225 in words is "forty-two trillion, four hundred three billion, one hundred thirty-two million, eleven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •