Base | Representation |
---|---|
bin | 111101000011101111… |
… | …1111000100100101111 |
3 | 110112110010202001111002 |
4 | 1322013133320210233 |
5 | 4122014302114411 |
6 | 140123045550515 |
7 | 12321222112415 |
oct | 1720737704457 |
9 | 415403661432 |
10 | 131122301231 |
11 | 50677136709 |
12 | 214b471543b |
13 | c4985631bc |
14 | 64bc5712b5 |
15 | 362665233b |
hex | 1e877f892f |
131122301231 has 24 divisors (see below), whose sum is σ = 147073650480. Its totient is φ = 116477911296.
The previous prime is 131122301213. The next prime is 131122301251. The reversal of 131122301231 is 132103221131.
It is a happy number.
It is not a de Polignac number, because 131122301231 - 214 = 131122284847 is a prime.
It is a super-2 number, since 2×1311223012312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131122301251) 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 23 ways as a sum of consecutive naturals, for example, 1611140 + ... + 1690566.
It is an arithmetic number, because the mean of its divisors is an integer number (6128068770).
Almost surely, 2131122301231 is an apocalyptic number.
131122301231 is a deficient number, since it is larger than the sum of its proper divisors (15951349249).
131122301231 is a wasteful number, since it uses less digits than its factorization.
131122301231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79751 (or 79732 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 131122301231 its reverse (132103221131), we get a palindrome (263225522362).
The spelling of 131122301231 in words is "one hundred thirty-one billion, one hundred twenty-two million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •