Base | Representation |
---|---|
bin | 11101100110001001000101… |
… | …010011001001001000011101 |
3 | 122001212121011201201221220102 |
4 | 131212021011103021020131 |
5 | 114030103234012043441 |
6 | 1140500415142230445 |
7 | 36263033126434526 |
oct | 3546110523111035 |
9 | 561777151657812 |
10 | 130164441518621 |
11 | 3852447a948034 |
12 | 127228a8125425 |
13 | 57825b9a60923 |
14 | 241ddc791784d |
15 | 100ad20e2169b |
hex | 7662454c921d |
130164441518621 has 8 divisors (see below), whose sum is σ = 130184606308320. Its totient is φ = 130144277349072.
The previous prime is 130164441518609. The next prime is 130164441518627. The reversal of 130164441518621 is 126815144461031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130164441518621 - 214 = 130164441502237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130164441518627) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586709711 + ... + 586931523.
It is an arithmetic number, because the mean of its divisors is an integer number (16273075788540).
Almost surely, 2130164441518621 is an apocalyptic number.
It is an amenable number.
130164441518621 is a deficient number, since it is larger than the sum of its proper divisors (20164789699).
130164441518621 is an equidigital number, since it uses as much as digits as its factorization.
130164441518621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310075.
The product of its (nonzero) digits is 552960, while the sum is 47.
Adding to 130164441518621 its reverse (126815144461031), we get a palindrome (256979585979652).
The spelling of 130164441518621 in words is "one hundred thirty trillion, one hundred sixty-four billion, four hundred forty-one million, five hundred eighteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •