Base | Representation |
---|---|
bin | 10000000010100010000… |
… | …111001000001101110001 |
3 | 10220101001101211220112010 |
4 | 100002202013020031301 |
5 | 121024332214433200 |
6 | 2202205204153133 |
7 | 142430215234503 |
oct | 20024207101561 |
9 | 3811041756463 |
10 | 1102231405425 |
11 | 3954a9990a07 |
12 | 1597530987a9 |
13 | 7cc2b184507 |
14 | 3b4c399bd73 |
15 | 1da11823150 |
hex | 100a21c8371 |
1102231405425 has 48 divisors (see below), whose sum is σ = 1843119532800. Its totient is φ = 581185059840.
The previous prime is 1102231405417. The next prime is 1102231405447. The reversal of 1102231405425 is 5245041322011.
It is not a de Polignac number, because 1102231405425 - 23 = 1102231405417 is a prime.
It is a super-2 number, since 2×11022314054252 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102231405392 and 1102231405401.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3200776 + ... + 3528374.
It is an arithmetic number, because the mean of its divisors is an integer number (38398323600).
Almost surely, 21102231405425 is an apocalyptic number.
1102231405425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1102231405425 is a deficient number, since it is larger than the sum of its proper divisors (740888127375).
1102231405425 is a wasteful number, since it uses less digits than its factorization.
1102231405425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328122 (or 328117 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 1102231405425 its reverse (5245041322011), we get a palindrome (6347272727436).
The spelling of 1102231405425 in words is "one trillion, one hundred two billion, two hundred thirty-one million, four hundred five thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •