Base | Representation |
---|---|
bin | 1110101111010000100… |
… | …0110110000110101010 |
3 | 220012120020010002202201 |
4 | 3223310020312012222 |
5 | 13122030220001014 |
6 | 312153105450414 |
7 | 24202430010145 |
oct | 3536410660652 |
9 | 805506102681 |
10 | 253204062634 |
11 | 984241019a6 |
12 | 410a5640a0a |
13 | 1ab52b20943 |
14 | c38017705c |
15 | 68be26ae74 |
hex | 3af42361aa |
253204062634 has 4 divisors (see below), whose sum is σ = 379806093954. Its totient is φ = 126602031316.
The previous prime is 253204062623. The next prime is 253204062677. The reversal of 253204062634 is 436260402352.
253204062634 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 236755230625 + 16448832009 = 486575^2 + 128253^2 .
It is a super-2 number, since 2×2532040626342 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 253204062593 and 253204062602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63301015657 + ... + 63301015660.
Almost surely, 2253204062634 is an apocalyptic number.
253204062634 is a deficient number, since it is larger than the sum of its proper divisors (126602031320).
253204062634 is a wasteful number, since it uses less digits than its factorization.
253204062634 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126602031319.
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 253204062634 its reverse (436260402352), we get a palindrome (689464464986).
The spelling of 253204062634 in words is "two hundred fifty-three billion, two hundred four million, sixty-two thousand, six hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •