Base | Representation |
---|---|
bin | 1110101111100111011… |
… | …0111010001011001101 |
3 | 220012210220200110000212 |
4 | 3223321312322023031 |
5 | 13122224301232023 |
6 | 312210414332205 |
7 | 24205003452011 |
oct | 3537166721315 |
9 | 805726613025 |
10 | 253300024013 |
11 | 98473295123 |
12 | 411117ba065 |
13 | 1ab6997c11a |
14 | c38cbd6541 |
15 | 68c78c3e78 |
hex | 3af9dba2cd |
253300024013 has 16 divisors (see below), whose sum is σ = 255504216240. Its totient is φ = 251107852800.
The previous prime is 253300024001. The next prime is 253300024051. The reversal of 253300024013 is 310420003352.
It can be written as a sum of positive squares in 8 ways, for example, as 14987146084 + 238312877929 = 122422^2 + 488173^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-253300024013 is a prime.
It is a Duffinian number.
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 253300024013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253300024513) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66289643 + ... + 66293463.
It is an arithmetic number, because the mean of its divisors is an integer number (15969013515).
Almost surely, 2253300024013 is an apocalyptic number.
It is an amenable number.
253300024013 is a deficient number, since it is larger than the sum of its proper divisors (2204192227).
253300024013 is a wasteful number, since it uses less digits than its factorization.
253300024013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5248.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 253300024013 its reverse (310420003352), we get a palindrome (563720027365).
The spelling of 253300024013 in words is "two hundred fifty-three billion, three hundred million, twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •