Base | Representation |
---|---|
bin | 11101101000010001110110… |
… | …111111100000111011110101 |
3 | 122002101122020211122012211212 |
4 | 131220101312333200323311 |
5 | 114040010022323401401 |
6 | 1141052104153411205 |
7 | 36306452411115254 |
oct | 3550216677407365 |
9 | 562348224565755 |
10 | 130311304122101 |
11 | 38580793a717a3 |
12 | 12747254109b05 |
13 | 57933c332052b |
14 | 242715a73879b |
15 | 100ea6936bdbb |
hex | 768476fe0ef5 |
130311304122101 has 8 divisors (see below), whose sum is σ = 132170477202240. Its totient is φ = 128454133385952.
The previous prime is 130311304122089. The next prime is 130311304122127. The reversal of 130311304122101 is 101221403113031.
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 130311304122101 - 222 = 130311299927797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130311304122161) 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, 500454911 + ... + 500715228.
It is an arithmetic number, because the mean of its divisors is an integer number (16521309650280).
Almost surely, 2130311304122101 is an apocalyptic number.
It is an amenable number.
130311304122101 is a deficient number, since it is larger than the sum of its proper divisors (1859173080139).
130311304122101 is a wasteful number, since it uses less digits than its factorization.
130311304122101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1001171995.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 130311304122101 its reverse (101221403113031), we get a palindrome (231532707235132).
The spelling of 130311304122101 in words is "one hundred thirty trillion, three hundred eleven billion, three hundred four million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •