Base | Representation |
---|---|
bin | 100001101010001001100… |
… | …011010010101001010101 |
3 | 22012010020221211011201001 |
4 | 201222021203102221111 |
5 | 300344011013312003 |
6 | 4530324432103301 |
7 | 326052204520363 |
oct | 41521143225125 |
9 | 8163227734631 |
10 | 2313000135253 |
11 | 811a35305115 |
12 | 314337094b31 |
13 | 13a1657b13b2 |
14 | 7dd42394633 |
15 | 40276b1861d |
hex | 21a898d2a55 |
2313000135253 has 4 divisors (see below), whose sum is σ = 2375513652460. Its totient is φ = 2250486618048.
The previous prime is 2313000135227. The next prime is 2313000135263. The reversal of 2313000135253 is 3525310003132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1576187344369 + 736812790884 = 1255463^2 + 858378^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313000135253 - 217 = 2313000004181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313000135223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31256758548 + ... + 31256758621.
It is an arithmetic number, because the mean of its divisors is an integer number (593878413115).
Almost surely, 22313000135253 is an apocalyptic number.
It is an amenable number.
2313000135253 is a deficient number, since it is larger than the sum of its proper divisors (62513517207).
2313000135253 is an equidigital number, since it uses as much as digits as its factorization.
2313000135253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62513517206.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 2313000135253 its reverse (3525310003132), we get a palindrome (5838310138385).
The spelling of 2313000135253 in words is "two trillion, three hundred thirteen billion, one hundred thirty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •