Base | Representation |
---|---|
bin | 1001000111010000011… |
… | …00011010000111011001 |
3 | 1002221020210101022212212 |
4 | 10203220030122013121 |
5 | 20112244100241441 |
6 | 355503523244505 |
7 | 31423506246452 |
oct | 4435014320731 |
9 | 1087223338785 |
10 | 313133212121 |
11 | 110887597a14 |
12 | 5082b819735 |
13 | 236b39a2142 |
14 | 11227466129 |
15 | 822a675eeb |
hex | 48e831a1d9 |
313133212121 has 8 divisors (see below), whose sum is σ = 331713563904. Its totient is φ = 294570721600.
The previous prime is 313133212081. The next prime is 313133212157. The reversal of 313133212121 is 121212331313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 313133212121 - 26 = 313133212057 is a prime.
It is a super-3 number, since 3×3131332121213 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313133212421) 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 7 ways as a sum of consecutive naturals, for example, 4429205 + ... + 4499346.
It is an arithmetic number, because the mean of its divisors is an integer number (41464195488).
Almost surely, 2313133212121 is an apocalyptic number.
It is an amenable number.
313133212121 is a deficient number, since it is larger than the sum of its proper divisors (18580351783).
313133212121 is a wasteful number, since it uses less digits than its factorization.
313133212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8930631.
The product of its digits is 648, while the sum is 23.
Adding to 313133212121 its reverse (121212331313), we get a palindrome (434345543434).
The spelling of 313133212121 in words is "three hundred thirteen billion, one hundred thirty-three million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •