Base | Representation |
---|---|
bin | 1001111101110010… |
… | …0000101101000101 |
3 | 20220102120200120022 |
4 | 2133130200231011 |
5 | 20434303120313 |
6 | 1121235344525 |
7 | 123201363323 |
oct | 23734405505 |
9 | 6812520508 |
10 | 2675051333 |
11 | 1152aa6729 |
12 | 627a52145 |
13 | 33828ca16 |
14 | 1b53bad13 |
15 | 109ca7c08 |
hex | 9f720b45 |
2675051333 has 2 divisors, whose sum is σ = 2675051334. Its totient is φ = 2675051332.
The previous prime is 2675051279. The next prime is 2675051339. The reversal of 2675051333 is 3331505762.
It is a happy number.
2675051333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2580436804 + 94614529 = 50798^2 + 9727^2 .
It is a cyclic number.
It is not a de Polignac number, because 2675051333 - 220 = 2674002757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2675051293 and 2675051302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2675051339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1337525666 + 1337525667.
It is an arithmetic number, because the mean of its divisors is an integer number (1337525667).
Almost surely, 22675051333 is an apocalyptic number.
It is an amenable number.
2675051333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2675051333 is an equidigital number, since it uses as much as digits as its factorization.
2675051333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56700, while the sum is 35.
The square root of 2675051333 is about 51720.8984164042. The cubic root of 2675051333 is about 1388.1744288050.
The spelling of 2675051333 in words is "two billion, six hundred seventy-five million, fifty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •