Base | Representation |
---|---|
bin | 10101011101010011010… |
… | …010000101001101110101 |
3 | 12012222010101112200122012 |
4 | 111131103102011031311 |
5 | 143124410141001123 |
6 | 3045224130414005 |
7 | 211351146650624 |
oct | 25352322051565 |
9 | 5188111480565 |
10 | 1474571031413 |
11 | 5193a89a5977 |
12 | 1b9946a31305 |
13 | a908906812c |
14 | 5152633b6bb |
15 | 28554be0378 |
hex | 15753485375 |
1474571031413 has 2 divisors, whose sum is σ = 1474571031414. Its totient is φ = 1474571031412.
The previous prime is 1474571031319. The next prime is 1474571031431. The reversal of 1474571031413 is 3141301754741.
It is a happy number.
Together with next prime (1474571031431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1231937945329 + 242633086084 = 1109927^2 + 492578^2 .
It is an emirp because it is prime and its reverse (3141301754741) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1474571031413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1474571031433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 737285515706 + 737285515707.
It is an arithmetic number, because the mean of its divisors is an integer number (737285515707).
Almost surely, 21474571031413 is an apocalyptic number.
It is an amenable number.
1474571031413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1474571031413 is an equidigital number, since it uses as much as digits as its factorization.
1474571031413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 41.
The spelling of 1474571031413 in words is "one trillion, four hundred seventy-four billion, five hundred seventy-one million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •