Base | Representation |
---|---|
bin | 111101000001000100… |
… | …0100011101001011001 |
3 | 110112012212101112011122 |
4 | 1322002020203221121 |
5 | 4121323232100441 |
6 | 140110112535025 |
7 | 12316050113462 |
oct | 1720210435131 |
9 | 415185345148 |
10 | 131032300121 |
11 | 50630354528 |
12 | 2148a551475 |
13 | c482a108c8 |
14 | 64b0623d69 |
15 | 361d7c534b |
hex | 1e82223a59 |
131032300121 has 8 divisors (see below), whose sum is σ = 141139981824. Its totient is φ = 121292170560.
The previous prime is 131032300111. The next prime is 131032300123. The reversal of 131032300121 is 121003230131.
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 131032300121 - 230 = 129958558297 is a prime.
It is a super-2 number, since 2×1310323001212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131032300121.
It is not an unprimeable number, because it can be changed into a prime (131032300123) 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, 91887296 + ... + 91888721.
It is an arithmetic number, because the mean of its divisors is an integer number (17642497728).
Almost surely, 2131032300121 is an apocalyptic number.
It is an amenable number.
131032300121 is a deficient number, since it is larger than the sum of its proper divisors (10107681703).
131032300121 is a wasteful number, since it uses less digits than its factorization.
131032300121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183776071.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131032300121 its reverse (121003230131), we get a palindrome (252035530252).
The spelling of 131032300121 in words is "one hundred thirty-one billion, thirty-two million, three hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •