Base | Representation |
---|---|
bin | 101101010000100111000… |
… | …110010111000111110100 |
3 | 102000100000001011021110022 |
4 | 231100213012113013310 |
5 | 401424203322120200 |
6 | 10340451203344312 |
7 | 440463650234546 |
oct | 55204706270764 |
9 | 12010001137408 |
10 | 3110212301300 |
11 | a9a040840a05 |
12 | 422943982098 |
13 | 1973a4000280 |
14 | aa76c381696 |
15 | 55d852c5885 |
hex | 2d4271971f4 |
3110212301300 has 36 divisors (see below), whose sum is σ = 7268326904076. Its totient is φ = 1148386080000.
The previous prime is 3110212301293. The next prime is 3110212301303. The reversal of 3110212301300 is 31032120113.
3110212301300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 44708565136 + 3065503736164 = 211444^2 + 1750858^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3110212301303) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1196234201 + ... + 1196236800.
Almost surely, 23110212301300 is an apocalyptic number.
It is an amenable number.
3110212301300 is an abundant number, since it is smaller than the sum of its proper divisors (4158114602776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3110212301300 is a wasteful number, since it uses less digits than its factorization.
3110212301300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2392471028 (or 2392471021 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3110212301300 its reverse (31032120113), we get a palindrome (3141244421413).
The spelling of 3110212301300 in words is "three trillion, one hundred ten billion, two hundred twelve million, three hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •