Base | Representation |
---|---|
bin | 111011100110110… |
… | …0011000100111101 |
3 | 12011101102120102221 |
4 | 1313031203010331 |
5 | 13044002242003 |
6 | 530243445341 |
7 | 100364030101 |
oct | 16715430475 |
9 | 5141376387 |
10 | 2000040253 |
11 | 936a74932 |
12 | 479986851 |
13 | 25b48c793 |
14 | 14d8a9901 |
15 | ba8be7bd |
hex | 7736313d |
2000040253 has 2 divisors, whose sum is σ = 2000040254. Its totient is φ = 2000040252.
The previous prime is 2000040247. The next prime is 2000040269. The reversal of 2000040253 is 3520400002.
It is an a-pointer prime, because the next prime (2000040269) can be obtained adding 2000040253 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1772241604 + 227798649 = 42098^2 + 15093^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000040253 - 25 = 2000040221 is a prime.
It is a super-2 number, since 2×20000402532 = 8000322027240608018, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000040283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000020126 + 1000020127.
It is an arithmetic number, because the mean of its divisors is an integer number (1000020127).
Almost surely, 22000040253 is an apocalyptic number.
It is an amenable number.
2000040253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000040253 is an equidigital number, since it uses as much as digits as its factorization.
2000040253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 16.
The square root of 2000040253 is about 44721.8095899529. The cubic root of 2000040253 is about 1259.9295024385.
Adding to 2000040253 its reverse (3520400002), we get a palindrome (5520440255).
The spelling of 2000040253 in words is "two billion, forty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •