Base | Representation |
---|---|
bin | 1101011101110001011… |
… | …1001100001010000001 |
3 | 211010002210211112002201 |
4 | 3113130113030022001 |
5 | 12242231031131223 |
6 | 254134403513201 |
7 | 22466403250432 |
oct | 3273427141201 |
9 | 733083745081 |
10 | 231330333313 |
11 | 8a119a40352 |
12 | 38a00088801 |
13 | 18a781acb41 |
14 | b2a70a5489 |
15 | 603dc80ead |
hex | 35dc5cc281 |
231330333313 has 4 divisors (see below), whose sum is σ = 235251186480. Its totient is φ = 227409480148.
The previous prime is 231330333263. The next prime is 231330333329. The reversal of 231330333313 is 313333033132.
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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-231330333313 is a prime.
It is a super-2 number, since 2×2313303333132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (231330331313) 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, 1960426495 + ... + 1960426612.
It is an arithmetic number, because the mean of its divisors is an integer number (58812796620).
Almost surely, 2231330333313 is an apocalyptic number.
It is an amenable number.
231330333313 is a deficient number, since it is larger than the sum of its proper divisors (3920853167).
231330333313 is an equidigital number, since it uses as much as digits as its factorization.
231330333313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3920853166.
The product of its (nonzero) digits is 13122, while the sum is 28.
Adding to 231330333313 its reverse (313333033132), we get a palindrome (544663366445).
The spelling of 231330333313 in words is "two hundred thirty-one billion, three hundred thirty million, three hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •