Base | Representation |
---|---|
bin | 100000110010100000001… |
… | …110011110111010101001 |
3 | 21222102000221022100022212 |
4 | 200302200032132322221 |
5 | 243404124224424223 |
6 | 4443043525054505 |
7 | 321535442415455 |
oct | 40624016367251 |
9 | 7872027270285 |
10 | 2253251014313 |
11 | 799664501222 |
12 | 304841257435 |
13 | 134633013a70 |
14 | 7b0b4d69665 |
15 | 3d92b420278 |
hex | 20ca039eea9 |
2253251014313 has 16 divisors (see below), whose sum is σ = 2436073575936. Its totient is φ = 2071786714560.
The previous prime is 2253251014307. The next prime is 2253251014327. The reversal of 2253251014313 is 3134101523522.
It is a cyclic number.
It is not a de Polignac number, because 2253251014313 - 220 = 2253249965737 is a 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 2253251014313.
It is not an unprimeable number, because it can be changed into a prime (2253251014393) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 36200048 + ... + 36262238.
It is an arithmetic number, because the mean of its divisors is an integer number (152254598496).
Almost surely, 22253251014313 is an apocalyptic number.
It is an amenable number.
2253251014313 is a deficient number, since it is larger than the sum of its proper divisors (182822561623).
2253251014313 is a wasteful number, since it uses less digits than its factorization.
2253251014313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73064.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 2253251014313 its reverse (3134101523522), we get a palindrome (5387352537835).
The spelling of 2253251014313 in words is "two trillion, two hundred fifty-three billion, two hundred fifty-one million, fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •