Base | Representation |
---|---|
bin | 11110110111010001100… |
… | …01110111100001100101 |
3 | 10202101020210101122010111 |
4 | 33123220301313201211 |
5 | 114333314114411123 |
6 | 2131101051253021 |
7 | 136421240450104 |
oct | 17335061674145 |
9 | 3671223348114 |
10 | 1060467341413 |
11 | 379818193527 |
12 | 15163844a171 |
13 | 790037b49bc |
14 | 39480dd003b |
15 | 1c8ba03090d |
hex | f6e8c77865 |
1060467341413 has 2 divisors, whose sum is σ = 1060467341414. Its totient is φ = 1060467341412.
The previous prime is 1060467341317. The next prime is 1060467341429. The reversal of 1060467341413 is 3141437640601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1058229862209 + 2237479204 = 1028703^2 + 47302^2 .
It is a cyclic number.
It is not a de Polignac number, because 1060467341413 - 213 = 1060467333221 is a prime.
It is a super-2 number, since 2×10604673414132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1060467342413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530233670706 + 530233670707.
It is an arithmetic number, because the mean of its divisors is an integer number (530233670707).
Almost surely, 21060467341413 is an apocalyptic number.
It is an amenable number.
1060467341413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1060467341413 is an equidigital number, since it uses as much as digits as its factorization.
1060467341413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145152, while the sum is 40.
The spelling of 1060467341413 in words is "one trillion, sixty billion, four hundred sixty-seven million, three hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •