Base | Representation |
---|---|
bin | 11101101101011011011100… |
… | …111010100011100110011001 |
3 | 122010122110201112211111012120 |
4 | 131231123130322203212121 |
5 | 114111304313030312401 |
6 | 1141522433112531453 |
7 | 36344151333356205 |
oct | 3555333472434631 |
9 | 563573645744176 |
10 | 130665201416601 |
11 | 386a7889846095 |
12 | 127a395b6b0b89 |
13 | 57ba8a2460477 |
14 | 243a32da27b05 |
15 | 1018d7d609836 |
hex | 76d6dcea3999 |
130665201416601 has 4 divisors (see below), whose sum is σ = 174220268555472. Its totient is φ = 87110134277732.
The previous prime is 130665201416597. The next prime is 130665201416609. The reversal of 130665201416601 is 106614102566031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130665201416601 - 22 = 130665201416597 is a prime.
It is a super-2 number, since 2×1306652014166012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130665201416609) 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, 21777533569431 + ... + 21777533569436.
It is an arithmetic number, because the mean of its divisors is an integer number (43555067138868).
Almost surely, 2130665201416601 is an apocalyptic number.
It is an amenable number.
130665201416601 is a deficient number, since it is larger than the sum of its proper divisors (43555067138871).
130665201416601 is an equidigital number, since it uses as much as digits as its factorization.
130665201416601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43555067138870.
The product of its (nonzero) digits is 155520, while the sum is 42.
The spelling of 130665201416601 in words is "one hundred thirty trillion, six hundred sixty-five billion, two hundred one million, four hundred sixteen thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •