Base | Representation |
---|---|
bin | 1001000111011001110… |
… | …01011101011110001011 |
3 | 1002221110021212211112010 |
4 | 10203230321131132023 |
5 | 20112424301144321 |
6 | 355515422551003 |
7 | 31425455121330 |
oct | 4435471353613 |
9 | 1087407784463 |
10 | 313212131211 |
11 | 1109180a0001 |
12 | 50852138463 |
13 | 236c7144525 |
14 | 11233b2a987 |
15 | 8232564676 |
hex | 48ece5d78b |
313212131211 has 8 divisors (see below), whose sum is σ = 477275628544. Its totient is φ = 178978360680.
The previous prime is 313212131189. The next prime is 313212131291. The reversal of 313212131211 is 112131212313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 313212131211 - 226 = 313145022347 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 14914863391 = 313212131211 / (3 + 1 + 3 + 2 + 1 + 2 + 1 + 3 + 1 + 2 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313212131291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7457431675 + ... + 7457431716.
It is an arithmetic number, because the mean of its divisors is an integer number (59659453568).
Almost surely, 2313212131211 is an apocalyptic number.
313212131211 is a deficient number, since it is larger than the sum of its proper divisors (164063497333).
313212131211 is a wasteful number, since it uses less digits than its factorization.
313212131211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14914863401.
The product of its digits is 216, while the sum is 21.
Adding to 313212131211 its reverse (112131212313), we get a palindrome (425343343524).
The spelling of 313212131211 in words is "three hundred thirteen billion, two hundred twelve million, one hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •