Base | Representation |
---|---|
bin | 100011010000010110010010… |
… | …0011001000000111010011001 |
3 | 1111200000020110110010101211202 |
4 | 1012200230210121000322121 |
5 | 311121321023324211301 |
6 | 3015314343503403545 |
7 | 122214501134362253 |
oct | 10640544431007231 |
9 | 1450006413111752 |
10 | 310110134210201 |
11 | 8a8a0a73230776 |
12 | 2a9455085b35b5 |
13 | 1040634c7bb150 |
14 | 56815a68c2cd3 |
15 | 25cba2255a66b |
hex | 11a0b24640e99 |
310110134210201 has 24 divisors (see below), whose sum is σ = 349267365308736. Its totient is φ = 273691121790240.
The previous prime is 310110134210179. The next prime is 310110134210249. The reversal of 310110134210201 is 102012431011013.
It is not a de Polignac number, because 310110134210201 - 230 = 310109060468377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (310110134240201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6136406 + ... + 25649088.
It is an arithmetic number, because the mean of its divisors is an integer number (14552806887864).
Almost surely, 2310110134210201 is an apocalyptic number.
It is an amenable number.
310110134210201 is a deficient number, since it is larger than the sum of its proper divisors (39157231098535).
310110134210201 is a wasteful number, since it uses less digits than its factorization.
310110134210201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19515053 (or 19515030 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 310110134210201 its reverse (102012431011013), we get a palindrome (412122565221214).
The spelling of 310110134210201 in words is "three hundred ten trillion, one hundred ten billion, one hundred thirty-four million, two hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •