Base | Representation |
---|---|
bin | 10100100101011101011… |
… | …110101010110101011101 |
3 | 12000020100210002211002220 |
4 | 110211131132222311131 |
5 | 141134111303424440 |
6 | 3001510344335553 |
7 | 204126263242302 |
oct | 24453536526535 |
9 | 5006323084086 |
10 | 1414612561245 |
11 | 4a5a2aa03894 |
12 | 1aa1b2a745b9 |
13 | a35220bbc10 |
14 | 4c6791b90a9 |
15 | 26be5e428d0 |
hex | 1495d7aad5d |
1414612561245 has 32 divisors (see below), whose sum is σ = 2437862241024. Its totient is φ = 696317222400.
The previous prime is 1414612561237. The next prime is 1414612561249. The reversal of 1414612561245 is 5421652164141.
It is not a de Polignac number, because 1414612561245 - 23 = 1414612561237 is a prime.
It is a super-2 number, since 2×14146125612452 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1414612561197 and 1414612561206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1414612561249) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 715360 + ... + 1827830.
It is an arithmetic number, because the mean of its divisors is an integer number (76183195032).
Almost surely, 21414612561245 is an apocalyptic number.
1414612561245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1414612561245 is a deficient number, since it is larger than the sum of its proper divisors (1023249679779).
1414612561245 is a wasteful number, since it uses less digits than its factorization.
1414612561245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1119013.
The product of its digits is 230400, while the sum is 42.
The spelling of 1414612561245 in words is "one trillion, four hundred fourteen billion, six hundred twelve million, five hundred sixty-one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •