Base | Representation |
---|---|
bin | 111110100000001111… |
… | …110011100001111111 |
3 | 20102020012222000022111 |
4 | 332200033303201333 |
5 | 2044421412212411 |
6 | 50455320354451 |
7 | 4564060102054 |
oct | 764017634177 |
9 | 212205860274 |
10 | 67113007231 |
11 | 2650a5a7736 |
12 | 11010015a27 |
13 | 64372ac1ca |
14 | 336942902b |
15 | 1b2be40721 |
hex | fa03f387f |
67113007231 has 4 divisors (see below), whose sum is σ = 67368190032. Its totient is φ = 66857824432.
The previous prime is 67113007219. The next prime is 67113007243. The reversal of 67113007231 is 13270031176.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (67113007219) and next prime (67113007243).
It is a cyclic number.
It is not a de Polignac number, because 67113007231 - 233 = 58523072639 is a prime.
It is a super-2 number, since 2×671130072312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 67113007193 and 67113007202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (67113007631) 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, 127591006 + ... + 127591531.
It is an arithmetic number, because the mean of its divisors is an integer number (16842047508).
Almost surely, 267113007231 is an apocalyptic number.
67113007231 is a deficient number, since it is larger than the sum of its proper divisors (255182801).
67113007231 is a wasteful number, since it uses less digits than its factorization.
67113007231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 255182800.
The product of its (nonzero) digits is 5292, while the sum is 31.
The spelling of 67113007231 in words is "sixty-seven billion, one hundred thirteen million, seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •