Base | Representation |
---|---|
bin | 1001000111010010011… |
… | …01101000101100101011 |
3 | 1002221021222120001102111 |
4 | 10203221031220230223 |
5 | 20112312434424321 |
6 | 355505333543151 |
7 | 31424104504153 |
oct | 4435115505453 |
9 | 1087258501374 |
10 | 313150311211 |
11 | 1108962067a1 |
12 | 508354a4ab7 |
13 | 236b73ab04a |
14 | 11229837763 |
15 | 822be025e1 |
hex | 48e9368b2b |
313150311211 has 4 divisors (see below), whose sum is σ = 320432876632. Its totient is φ = 305867745792.
The previous prime is 313150311181. The next prime is 313150311223. The reversal of 313150311211 is 112113051313.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112113051313 = 11621 ⋅9647453.
It is a cyclic number.
It is not a de Polignac number, because 313150311211 - 223 = 313141922603 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313150311241) 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 3 ways as a sum of consecutive naturals, for example, 3641282646 + ... + 3641282731.
It is an arithmetic number, because the mean of its divisors is an integer number (80108219158).
Almost surely, 2313150311211 is an apocalyptic number.
313150311211 is a deficient number, since it is larger than the sum of its proper divisors (7282565421).
313150311211 is an equidigital number, since it uses as much as digits as its factorization.
313150311211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7282565420.
The product of its (nonzero) digits is 270, while the sum is 22.
Adding to 313150311211 its reverse (112113051313), we get a palindrome (425263362524).
The spelling of 313150311211 in words is "three hundred thirteen billion, one hundred fifty million, three hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •