Base | Representation |
---|---|
bin | 11101101001110111011101… |
… | …110100010001100010011101 |
3 | 122002210001212011012100000021 |
4 | 131221313131310101202131 |
5 | 114043301441233123401 |
6 | 1141214150050032141 |
7 | 36320364114556156 |
oct | 3551673564214235 |
9 | 562701764170007 |
10 | 130420403411101 |
11 | 38612a89744351 |
12 | 12764421278651 |
13 | 57a078c03523b |
14 | 242c54a05892d |
15 | 10128023472a1 |
hex | 769dddd1189d |
130420403411101 has 8 divisors (see below), whose sum is σ = 139022415363200. Its totient is φ = 121992169478400.
The previous prime is 130420403411029. The next prime is 130420403411107. The reversal of 130420403411101 is 101114304024031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130420403411101 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 (130420403411107) 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, 43444503300 + ... + 43444506301.
It is an arithmetic number, because the mean of its divisors is an integer number (17377801920400).
Almost surely, 2130420403411101 is an apocalyptic number.
It is an amenable number.
130420403411101 is a deficient number, since it is larger than the sum of its proper divisors (8602011952099).
130420403411101 is an equidigital number, since it uses as much as digits as its factorization.
130420403411101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86889009699.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 130420403411101 its reverse (101114304024031), we get a palindrome (231534707435132).
The spelling of 130420403411101 in words is "one hundred thirty trillion, four hundred twenty billion, four hundred three million, four hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •