Base | Representation |
---|---|
bin | 1001000010001110101… |
… | …00101100011000101011 |
3 | 1002200021200210222002011 |
4 | 10201013110230120223 |
5 | 20041232132033311 |
6 | 354340031220351 |
7 | 31266564415150 |
oct | 4410724543053 |
9 | 1080250728064 |
10 | 310434252331 |
11 | 10a722051535 |
12 | 501b79776b7 |
13 | 23373791008 |
14 | 1104cc24227 |
15 | 811d749321 |
hex | 484752c62b |
310434252331 has 16 divisors (see below), whose sum is σ = 363312246528. Its totient is φ = 259698348000.
The previous prime is 310434252329. The next prime is 310434252347. The reversal of 310434252331 is 133252434013.
It is a happy number.
It is not a de Polignac number, because 310434252331 - 21 = 310434252329 is a prime.
It is a super-2 number, since 2×3104342523312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 310434252293 and 310434252302.
It is not an unprimeable number, because it can be changed into a prime (310434252301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4765 + ... + 787966.
It is an arithmetic number, because the mean of its divisors is an integer number (22707015408).
Almost surely, 2310434252331 is an apocalyptic number.
310434252331 is a deficient number, since it is larger than the sum of its proper divisors (52877994197).
310434252331 is a wasteful number, since it uses less digits than its factorization.
310434252331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 794082.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 310434252331 its reverse (133252434013), we get a palindrome (443686686344).
The spelling of 310434252331 in words is "three hundred ten billion, four hundred thirty-four million, two hundred fifty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •