Base | Representation |
---|---|
bin | 100001100111011111101… |
… | …110111010011011001101 |
3 | 22011211220101202220102011 |
4 | 201213133232322123031 |
5 | 300322142132230203 |
6 | 4525134014301221 |
7 | 325621460655202 |
oct | 41473756723315 |
9 | 8154811686364 |
10 | 2310151055053 |
11 | 810803054a86 |
12 | 313880ab7811 |
13 | 139b0045b61a |
14 | 7db51c35ca9 |
15 | 4015b93676d |
hex | 219dfbba6cd |
2310151055053 has 8 divisors (see below), whose sum is σ = 2325694527000. Its totient is φ = 2294608104768.
The previous prime is 2310151055041. The next prime is 2310151055059. The reversal of 2310151055053 is 3505501510132.
It can be written as a sum of positive squares in 4 ways, for example, as 250802643204 + 2059348411849 = 500802^2 + 1435043^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2310151055053 - 241 = 111127799501 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 (2310151055059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13595703 + ... + 13764571.
It is an arithmetic number, because the mean of its divisors is an integer number (290711815875).
Almost surely, 22310151055053 is an apocalyptic number.
It is an amenable number.
2310151055053 is a deficient number, since it is larger than the sum of its proper divisors (15543471947).
2310151055053 is a wasteful number, since it uses less digits than its factorization.
2310151055053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260831.
The product of its (nonzero) digits is 11250, while the sum is 31.
Adding to 2310151055053 its reverse (3505501510132), we get a palindrome (5815652565185).
The spelling of 2310151055053 in words is "two trillion, three hundred ten billion, one hundred fifty-one million, fifty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •