Base | Representation |
---|---|
bin | 1001000111001100110… |
… | …10111010101101101111 |
3 | 1002221011201101211100001 |
4 | 10203212122322231233 |
5 | 20112213441224411 |
6 | 355500541445131 |
7 | 31422665336251 |
oct | 4434632725557 |
9 | 1087151354301 |
10 | 313103461231 |
11 | 110871817700 |
12 | 508218707a7 |
13 | 236aa786672 |
14 | 1122351dcd1 |
15 | 8227c4adc1 |
hex | 48e66bab6f |
313103461231 has 6 divisors (see below), whose sum is σ = 344155044296. Its totient is φ = 284639510100.
The previous prime is 313103461219. The next prime is 313103461277. The reversal of 313103461231 is 132164301313.
It is not a de Polignac number, because 313103461231 - 223 = 313095072623 is a prime.
It is a super-2 number, since 2×3131034612312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 313103461231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313103431231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1293815835 + ... + 1293816076.
Almost surely, 2313103461231 is an apocalyptic number.
313103461231 is a deficient number, since it is larger than the sum of its proper divisors (31051583065).
313103461231 is a wasteful number, since it uses less digits than its factorization.
313103461231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2587631933 (or 2587631922 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 313103461231 its reverse (132164301313), we get a palindrome (445267762544).
The spelling of 313103461231 in words is "three hundred thirteen billion, one hundred three million, four hundred sixty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •