Base | Representation |
---|---|
bin | 11101100110000000101011… |
… | …010011110111000000111111 |
3 | 122001211201212200210222022211 |
4 | 131212000223103313000333 |
5 | 114024431242341024401 |
6 | 1140452323352521251 |
7 | 36262263350205202 |
oct | 3546005323670077 |
9 | 561751780728284 |
10 | 130155415564351 |
11 | 38520668a39aa1 |
12 | 12720ba93b0227 |
13 | 57817abac3c98 |
14 | 241d7acca7939 |
15 | 100a993819951 |
hex | 76602b4f703f |
130155415564351 has 4 divisors (see below), whose sum is σ = 130156079206104. Its totient is φ = 130154751922600.
The previous prime is 130155415564271. The next prime is 130155415564373. The reversal of 130155415564351 is 153465514551031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130155415564351 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130155415564295 and 130155415564304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130155415561351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 331526605 + ... + 331918966.
It is an arithmetic number, because the mean of its divisors is an integer number (32539019801526).
Almost surely, 2130155415564351 is an apocalyptic number.
130155415564351 is a deficient number, since it is larger than the sum of its proper divisors (663641753).
130155415564351 is an equidigital number, since it uses as much as digits as its factorization.
130155415564351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663641752.
The product of its (nonzero) digits is 2700000, while the sum is 49.
The spelling of 130155415564351 in words is "one hundred thirty trillion, one hundred fifty-five billion, four hundred fifteen million, five hundred sixty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •