Base | Representation |
---|---|
bin | 11101100110000000101011… |
… | …010011110111000001010101 |
3 | 122001211201212200210222100122 |
4 | 131212000223103313001111 |
5 | 114024431242341024443 |
6 | 1140452323352521325 |
7 | 36262263350205233 |
oct | 3546005323670125 |
9 | 561751780728318 |
10 | 130155415564373 |
11 | 38520668a3a011 |
12 | 12720ba93b0245 |
13 | 57817abac3cb4 |
14 | 241d7acca7953 |
15 | 100a993819968 |
hex | 76602b4f7055 |
130155415564373 has 2 divisors, whose sum is σ = 130155415564374. Its totient is φ = 130155415564372.
The previous prime is 130155415564271. The next prime is 130155415564411. The reversal of 130155415564373 is 373465514551031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108844839034129 + 21310576530244 = 10432873^2 + 4616338^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130155415564373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130155415564073) 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, 65077707782186 + 65077707782187.
It is an arithmetic number, because the mean of its divisors is an integer number (65077707782187).
Almost surely, 2130155415564373 is an apocalyptic number.
It is an amenable number.
130155415564373 is a deficient number, since it is larger than the sum of its proper divisors (1).
130155415564373 is an equidigital number, since it uses as much as digits as its factorization.
130155415564373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340000, while the sum is 53.
The spelling of 130155415564373 in words is "one hundred thirty trillion, one hundred fifty-five billion, four hundred fifteen million, five hundred sixty-four thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •