Base | Representation |
---|---|
bin | 1100010101111010… |
… | …0101101100011101 |
3 | 22112220020110022111 |
4 | 3011132211230131 |
5 | 23241130132034 |
6 | 1304431514021 |
7 | 145050066631 |
oct | 30536455435 |
9 | 8486213274 |
10 | 3313130269 |
11 | 14501a2899 |
12 | 785688911 |
13 | 40a52b917 |
14 | 236036dc1 |
15 | 145ce8364 |
hex | c57a5b1d |
3313130269 has 2 divisors, whose sum is σ = 3313130270. Its totient is φ = 3313130268.
The previous prime is 3313130147. The next prime is 3313130279. The reversal of 3313130269 is 9620313133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2312167225 + 1000963044 = 48085^2 + 31638^2 .
It is a cyclic number.
It is not a de Polignac number, because 3313130269 - 213 = 3313122077 is a prime.
It is a super-2 number, since 2×33131302692 = 21953664358728024722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3313130269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3313130279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656565134 + 1656565135.
It is an arithmetic number, because the mean of its divisors is an integer number (1656565135).
Almost surely, 23313130269 is an apocalyptic number.
It is an amenable number.
3313130269 is a deficient number, since it is larger than the sum of its proper divisors (1).
3313130269 is an equidigital number, since it uses as much as digits as its factorization.
3313130269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8748, while the sum is 31.
The square root of 3313130269 is about 57559.7973328607. The cubic root of 3313130269 is about 1490.7775274681. Note that the first 3 decimals are identical.
The spelling of 3313130269 in words is "three billion, three hundred thirteen million, one hundred thirty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •