Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1110111110001001101 |
3 | 110112011022121122202002 |
4 | 1322000303313301031 |
5 | 4121302041202201 |
6 | 140104001042045 |
7 | 12315360323123 |
oct | 1720063676115 |
9 | 415138548662 |
10 | 131010100301 |
11 | 50619871473 |
12 | 21483026325 |
13 | c47b23a112 |
14 | 64ab6c5913 |
15 | 361b88c76b |
hex | 1e80cf7c4d |
131010100301 has 4 divisors (see below), whose sum is σ = 131040132192. Its totient is φ = 130980068412.
The previous prime is 131010100289. The next prime is 131010100307. The reversal of 131010100301 is 103001010131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103001010131 = 166571 ⋅618361.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131010100301 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 (131010100307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15009401 + ... + 15018126.
It is an arithmetic number, because the mean of its divisors is an integer number (32760033048).
Almost surely, 2131010100301 is an apocalyptic number.
It is an amenable number.
131010100301 is a deficient number, since it is larger than the sum of its proper divisors (30031891).
131010100301 is an equidigital number, since it uses as much as digits as its factorization.
131010100301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30031890.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 131010100301 its reverse (103001010131), we get a palindrome (234011110432).
The spelling of 131010100301 in words is "one hundred thirty-one billion, ten million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •