Base | Representation |
---|---|
bin | 10000001011101010111… |
… | …001000110100111100001 |
3 | 10221022101010222002020220 |
4 | 100023222321012213201 |
5 | 121204430323301400 |
6 | 2210510515553253 |
7 | 143225306304051 |
oct | 20135271064741 |
9 | 3838333862226 |
10 | 1112042400225 |
11 | 399683a42579 |
12 | 15b6308bb829 |
13 | 80b32966c93 |
14 | 3bb749a1561 |
15 | 1ddd7ce97a0 |
hex | 102eae469e1 |
1112042400225 has 48 divisors (see below), whose sum is σ = 1951032268800. Its totient is φ = 557687437120.
The previous prime is 1112042400199. The next prime is 1112042400289. The reversal of 1112042400225 is 5220042402111.
It is not a de Polignac number, because 1112042400225 - 229 = 1111505529313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112042400195 and 1112042400204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5361465 + ... + 5565014.
It is an arithmetic number, because the mean of its divisors is an integer number (40646505600).
Almost surely, 21112042400225 is an apocalyptic number.
1112042400225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1112042400225 is a deficient number, since it is larger than the sum of its proper divisors (838989868575).
1112042400225 is a wasteful number, since it uses less digits than its factorization.
1112042400225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10926574 (or 10926569 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 1112042400225 its reverse (5220042402111), we get a palindrome (6332084802336).
The spelling of 1112042400225 in words is "one trillion, one hundred twelve billion, forty-two million, four hundred thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •