Base | Representation |
---|---|
bin | 1001000001011010111… |
… | …00111010110110101101 |
3 | 1002122011110001212202212 |
4 | 10200231130322312231 |
5 | 20034340022414013 |
6 | 354225004100205 |
7 | 31253044142600 |
oct | 4405534726655 |
9 | 1078143055685 |
10 | 310000201133 |
11 | 10a51a039437 |
12 | 500b6534665 |
13 | 2330488979c |
14 | 1100b318337 |
15 | 80e55ab6a8 |
hex | 482d73adad |
310000201133 has 12 divisors (see below), whose sum is σ = 381824978652. Its totient is φ = 250084195200.
The previous prime is 310000201111. The next prime is 310000201151. The reversal of 310000201133 is 331102000013.
It can be written as a sum of positive squares in 2 ways, for example, as 252086334724 + 57913866409 = 502082^2 + 240653^2 .
It is not a de Polignac number, because 310000201133 - 28 = 310000200877 is a prime.
It is a super-2 number, since 2×3100002011332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (310000201153) 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, 186073718 + ... + 186075383.
It is an arithmetic number, because the mean of its divisors is an integer number (31818748221).
Almost surely, 2310000201133 is an apocalyptic number.
It is an amenable number.
310000201133 is a deficient number, since it is larger than the sum of its proper divisors (71824777519).
310000201133 is a wasteful number, since it uses less digits than its factorization.
310000201133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372149132 (or 372149125 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 310000201133 its reverse (331102000013), we get a palindrome (641102201146).
The spelling of 310000201133 in words is "three hundred ten billion, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •