Base | Representation |
---|---|
bin | 11101101010001100100001… |
… | …100001101010100111010101 |
3 | 122002212020012221102110002222 |
4 | 131222030201201222213111 |
5 | 114044134243120021440 |
6 | 1141232405442112125 |
7 | 36322124331353426 |
oct | 3552144141524725 |
9 | 562766187373088 |
10 | 130443014220245 |
11 | 38621631980981 |
12 | 1276889164b645 |
13 | 57a2953598a4c |
14 | 242d692d9764d |
15 | 10131c73cb2b5 |
hex | 76a32186a9d5 |
130443014220245 has 8 divisors (see below), whose sum is σ = 161581024066560. Its totient is φ = 100988140041360.
The previous prime is 130443014220223. The next prime is 130443014220251. The reversal of 130443014220245 is 542022410344031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130443014220245 - 28 = 130443014219989 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 420783916685 + ... + 420783916994.
It is an arithmetic number, because the mean of its divisors is an integer number (20197628008320).
Almost surely, 2130443014220245 is an apocalyptic number.
It is an amenable number.
130443014220245 is a deficient number, since it is larger than the sum of its proper divisors (31138009846315).
130443014220245 is an equidigital number, since it uses as much as digits as its factorization.
130443014220245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841567833715.
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 130443014220245 its reverse (542022410344031), we get a palindrome (672465424564276).
The spelling of 130443014220245 in words is "one hundred thirty trillion, four hundred forty-three billion, fourteen million, two hundred twenty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •