Base | Representation |
---|---|
bin | 11101100101001111010100… |
… | …000100000100100111111001 |
3 | 122001122200001210122002221121 |
4 | 131211033110010010213321 |
5 | 114023044220010403231 |
6 | 1140412120102505241 |
7 | 36255406026066352 |
oct | 3545172404044771 |
9 | 561580053562847 |
10 | 130102412200441 |
11 | 38500139a1920a |
12 | 12712876735221 |
13 | 57797b2a62865 |
14 | 241adc1736d29 |
15 | 10093e0469311 |
hex | 7653d41049f9 |
130102412200441 has 12 divisors (see below), whose sum is σ = 131120512379856. Its totient is φ = 129091537607760.
The previous prime is 130102412200427. The next prime is 130102412200447. The reversal of 130102412200441 is 144002214201031.
It is not a de Polignac number, because 130102412200441 - 217 = 130102412069369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130102412200447) 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 11 ways as a sum of consecutive naturals, for example, 10030890 + ... + 18995356.
It is an arithmetic number, because the mean of its divisors is an integer number (10926709364988).
Almost surely, 2130102412200441 is an apocalyptic number.
It is an amenable number.
130102412200441 is a deficient number, since it is larger than the sum of its proper divisors (1018100179415).
130102412200441 is an frugal number, since it uses more digits than its factorization.
130102412200441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8965272 (or 8965091 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 130102412200441 its reverse (144002214201031), we get a palindrome (274104626401472).
The spelling of 130102412200441 in words is "one hundred thirty trillion, one hundred two billion, four hundred twelve million, two hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •