Base | Representation |
---|---|
bin | 10100101010110001010… |
… | …000111011000011110101 |
3 | 12000210002001212211121122 |
4 | 110222301100323003311 |
5 | 141232300140224000 |
6 | 3004252145153325 |
7 | 204420454045634 |
oct | 24526120730365 |
9 | 5023061784548 |
10 | 1420313211125 |
11 | 4a8395864486 |
12 | 1ab32402b845 |
13 | a3c20156923 |
14 | 4ca5a34351b |
15 | 26e2b649085 |
hex | 14ab143b0f5 |
1420313211125 has 16 divisors (see below), whose sum is σ = 1833673336560. Its totient is φ = 1097069512000.
The previous prime is 1420313211077. The next prime is 1420313211151. The reversal of 1420313211125 is 5211123130241.
It can be written as a sum of positive squares in 8 ways, for example, as 429394499524 + 990918711601 = 655282^2 + 995449^2 .
It is not a de Polignac number, because 1420313211125 - 212 = 1420313207029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1420313211094 and 1420313211103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 195901646 + ... + 195908895.
It is an arithmetic number, because the mean of its divisors is an integer number (114604583535).
Almost surely, 21420313211125 is an apocalyptic number.
It is an amenable number.
1420313211125 is a deficient number, since it is larger than the sum of its proper divisors (413360125435).
1420313211125 is an equidigital number, since it uses as much as digits as its factorization.
1420313211125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391810585 (or 391810575 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 1420313211125 its reverse (5211123130241), we get a palindrome (6631436341366).
The spelling of 1420313211125 in words is "one trillion, four hundred twenty billion, three hundred thirteen million, two hundred eleven thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •