Base | Representation |
---|---|
bin | 1001111101001101… |
… | …1001011011101101 |
3 | 20220021002022100212 |
4 | 2133103121123231 |
5 | 20433200143003 |
6 | 1121112232205 |
7 | 123142153142 |
oct | 23723313355 |
9 | 6807068325 |
10 | 2672662253 |
11 | 1151714788 |
12 | 62709b665 |
13 | 337934471 |
14 | 1b4d583c9 |
15 | 109984dd8 |
hex | 9f4d96ed |
2672662253 has 2 divisors, whose sum is σ = 2672662254. Its totient is φ = 2672662252.
The previous prime is 2672662249. The next prime is 2672662277. The reversal of 2672662253 is 3522662762.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2623283524 + 49378729 = 51218^2 + 7027^2 .
It is a cyclic number.
It is not a de Polignac number, because 2672662253 - 22 = 2672662249 is a prime.
It is a super-2 number, since 2×26726622532 = 14286247037222072018, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2672662253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2672662283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1336331126 + 1336331127.
It is an arithmetic number, because the mean of its divisors is an integer number (1336331127).
Almost surely, 22672662253 is an apocalyptic number.
It is an amenable number.
2672662253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2672662253 is an equidigital number, since it uses as much as digits as its factorization.
2672662253 is an evil number, because the sum of its binary digits is even.
The product of its digits is 362880, while the sum is 41.
The square root of 2672662253 is about 51697.7973708745. The cubic root of 2672662253 is about 1387.7610476336.
The spelling of 2672662253 in words is "two billion, six hundred seventy-two million, six hundred sixty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •