Base | Representation |
---|---|
bin | 10101011110111101… |
… | …100011010010110011 |
3 | 2012112122120100101100 |
4 | 111132331203102303 |
5 | 334220403431011 |
6 | 14333003535443 |
7 | 1444435010106 |
oct | 253675432263 |
9 | 65478510340 |
10 | 23068030131 |
11 | 9868335513 |
12 | 457952a583 |
13 | 22381bb193 |
14 | 118b95a73d |
15 | 90029bd56 |
hex | 55ef634b3 |
23068030131 has 48 divisors (see below), whose sum is σ = 35997287040. Its totient is φ = 14187882240.
The previous prime is 23068030049. The next prime is 23068030147. The reversal of 23068030131 is 13103086032.
It is a happy number.
It is not a de Polignac number, because 23068030131 - 210 = 23068029107 is a prime.
It is a super-2 number, since 2×230680301312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23068030095 and 23068030104.
It is not an unprimeable number, because it can be changed into a prime (23068030151) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2546971 + ... + 2556011.
It is an arithmetic number, because the mean of its divisors is an integer number (749943480).
Almost surely, 223068030131 is an apocalyptic number.
23068030131 is a deficient number, since it is larger than the sum of its proper divisors (12929256909).
23068030131 is a wasteful number, since it uses less digits than its factorization.
23068030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9456 (or 9453 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The spelling of 23068030131 in words is "twenty-three billion, sixty-eight million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •