Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0100110110101001101 |
3 | 110110011000222110220120 |
4 | 1321102120212311031 |
5 | 4113203141413401 |
6 | 135454414335153 |
7 | 12260151642021 |
oct | 1712230466515 |
9 | 413130873816 |
10 | 130231201101 |
11 | 5025a132a21 |
12 | 212a61ba4b9 |
13 | c385a64711 |
14 | 6436090381 |
15 | 35c32d2836 |
hex | 1e52626d4d |
130231201101 has 8 divisors (see below), whose sum is σ = 173658545280. Its totient is φ = 86812328832.
The previous prime is 130231201081. The next prime is 130231201127. The reversal of 130231201101 is 101102132031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130231201101 - 214 = 130231184717 is a prime.
It is a super-2 number, since 2×1302312011012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130231203101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2082021 + ... + 2143658.
It is an arithmetic number, because the mean of its divisors is an integer number (21707318160).
Almost surely, 2130231201101 is an apocalyptic number.
It is an amenable number.
130231201101 is a deficient number, since it is larger than the sum of its proper divisors (43427344179).
130231201101 is a wasteful number, since it uses less digits than its factorization.
130231201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4235955.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 130231201101 its reverse (101102132031), we get a palindrome (231333333132).
The spelling of 130231201101 in words is "one hundred thirty billion, two hundred thirty-one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •