Base | Representation |
---|---|
bin | 10100100111010101100… |
… | …001011100110011110001 |
3 | 12000102120010210100201121 |
4 | 110213111201130303301 |
5 | 141202222344244040 |
6 | 3002442251302241 |
7 | 204230220022453 |
oct | 24472541346361 |
9 | 5012503710647 |
10 | 1416626556145 |
11 | 4a6873839a89 |
12 | 1aa67544a981 |
13 | a3783426288 |
14 | 4c7ca8782d3 |
15 | 26cb2b6bc4a |
hex | 149d585ccf1 |
1416626556145 has 4 divisors (see below), whose sum is σ = 1699951867380. Its totient is φ = 1133301244912.
The previous prime is 1416626556131. The next prime is 1416626556157. The reversal of 1416626556145 is 5416556266141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 737029118016 + 679597438129 = 858504^2 + 824377^2 .
It is a cyclic number.
It is not a de Polignac number, because 1416626556145 - 225 = 1416593001713 is a prime.
It is a super-2 number, since 2×14166265561452 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1416626556092 and 1416626556101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141662655610 + ... + 141662655619.
It is an arithmetic number, because the mean of its divisors is an integer number (424987966845).
Almost surely, 21416626556145 is an apocalyptic number.
It is an amenable number.
1416626556145 is a deficient number, since it is larger than the sum of its proper divisors (283325311235).
1416626556145 is an equidigital number, since it uses as much as digits as its factorization.
1416626556145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283325311234.
The product of its digits is 5184000, while the sum is 52.
The spelling of 1416626556145 in words is "one trillion, four hundred sixteen billion, six hundred twenty-six million, five hundred fifty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •