Base | Representation |
---|---|
bin | 111111101001011… |
… | …0110000000101101 |
3 | 12111211121001220101 |
4 | 1333102312000231 |
5 | 13333211140003 |
6 | 551530151101 |
7 | 103631456626 |
oct | 17722660055 |
9 | 5454531811 |
10 | 2135646253 |
11 | 9a6575704 |
12 | 4b7282491 |
13 | 2805bbb10 |
14 | 1638c8a4d |
15 | c775911d |
hex | 7f4b602d |
2135646253 has 16 divisors (see below), whose sum is σ = 2419721136. Its totient is φ = 1871285760.
The previous prime is 2135646229. The next prime is 2135646257. The reversal of 2135646253 is 3526465312.
It can be written as a sum of positive squares in 8 ways, for example, as 684188649 + 1451457604 = 26157^2 + 38098^2 .
It is a cyclic number.
It is not a de Polignac number, because 2135646253 - 25 = 2135646221 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2135646257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34426 + ... + 73867.
It is an arithmetic number, because the mean of its divisors is an integer number (151232571).
Almost surely, 22135646253 is an apocalyptic number.
It is an amenable number.
2135646253 is a deficient number, since it is larger than the sum of its proper divisors (284074883).
2135646253 is a wasteful number, since it uses less digits than its factorization.
2135646253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108384.
The product of its digits is 129600, while the sum is 37.
The square root of 2135646253 is about 46213.0528422436. The cubic root of 2135646253 is about 1287.7842404832.
The spelling of 2135646253 in words is "two billion, one hundred thirty-five million, six hundred forty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •