Base | Representation |
---|---|
bin | 10010111101111011001… |
… | …010011011101100110101 |
3 | 11121121102001222212022002 |
4 | 102331323022123230311 |
5 | 132323422001020112 |
6 | 2434443121145045 |
7 | 163112331202136 |
oct | 22757312335465 |
9 | 4547361885262 |
10 | 1303441423157 |
11 | 462871780365 |
12 | 190747a8b185 |
13 | 95bb60947c3 |
14 | 47130659c8d |
15 | 23d8b1111c2 |
hex | 12f7b29bb35 |
1303441423157 has 2 divisors, whose sum is σ = 1303441423158. Its totient is φ = 1303441423156.
The previous prime is 1303441423111. The next prime is 1303441423169. The reversal of 1303441423157 is 7513241443031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1252058054116 + 51383369041 = 1118954^2 + 226679^2 .
It is a cyclic number.
It is not a de Polignac number, because 1303441423157 - 218 = 1303441161013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1303441423157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1303441423357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651720711578 + 651720711579.
It is an arithmetic number, because the mean of its divisors is an integer number (651720711579).
Almost surely, 21303441423157 is an apocalyptic number.
It is an amenable number.
1303441423157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303441423157 is an equidigital number, since it uses as much as digits as its factorization.
1303441423157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 38.
Adding to 1303441423157 its reverse (7513241443031), we get a palindrome (8816682866188).
The spelling of 1303441423157 in words is "one trillion, three hundred three billion, four hundred forty-one million, four hundred twenty-three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •