Base | Representation |
---|---|
bin | 11101101010001010101010… |
… | …101110101000011010100001 |
3 | 122002212001002001001222211121 |
4 | 131222022222232220122201 |
5 | 114044121202402133101 |
6 | 1141231440003212241 |
7 | 36322024050362032 |
oct | 3552125256503241 |
9 | 562761061058747 |
10 | 130441021130401 |
11 | 386207a9923a93 |
12 | 12768416077081 |
13 | 57a26c66a0a47 |
14 | 242d5443baa89 |
15 | 101310c4310a1 |
hex | 76a2aaba86a1 |
130441021130401 has 16 divisors (see below), whose sum is σ = 131705581047040. Its totient is φ = 129181990803840.
The previous prime is 130441021130389. The next prime is 130441021130513. The reversal of 130441021130401 is 104031120144031.
It is a cyclic number.
It is not a de Polignac number, because 130441021130401 - 215 = 130441021097633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130441021130801) 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 in 15 ways as a sum of consecutive naturals, for example, 1324507480 + ... + 1324605958.
It is an arithmetic number, because the mean of its divisors is an integer number (8231598815440).
Almost surely, 2130441021130401 is an apocalyptic number.
It is an amenable number.
130441021130401 is a deficient number, since it is larger than the sum of its proper divisors (1264559916639).
130441021130401 is a wasteful number, since it uses less digits than its factorization.
130441021130401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126424.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 130441021130401 its reverse (104031120144031), we get a palindrome (234472141274432).
The spelling of 130441021130401 in words is "one hundred thirty trillion, four hundred forty-one billion, twenty-one million, one hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •