Base | Representation |
---|---|
bin | 10101001100100100011… |
… | …111010100001001111101 |
3 | 12011020202101100201121101 |
4 | 111030210133110021331 |
5 | 142331112130232031 |
6 | 3033053335533101 |
7 | 210144025403551 |
oct | 25144437241175 |
9 | 5136671321541 |
10 | 1456606102141 |
11 | 51181a197693 |
12 | 1b637252a191 |
13 | a7485196878 |
14 | 5070043d861 |
15 | 27d52963361 |
hex | 153247d427d |
1456606102141 has 12 divisors (see below), whose sum is σ = 1494538856352. Its totient is φ = 1419614012000.
The previous prime is 1456606102111. The next prime is 1456606102153. The reversal of 1456606102141 is 1412016066541.
It is not a de Polignac number, because 1456606102141 - 213 = 1456606093949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1456606102141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1456606102111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1186056 + ... + 2078446.
It is an arithmetic number, because the mean of its divisors is an integer number (124544904696).
Almost surely, 21456606102141 is an apocalyptic number.
It is an amenable number.
1456606102141 is a deficient number, since it is larger than the sum of its proper divisors (37932754211).
1456606102141 is an frugal number, since it uses more digits than its factorization.
1456606102141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893444 (or 893403 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 37.
The spelling of 1456606102141 in words is "one trillion, four hundred fifty-six billion, six hundred six million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •