Base | Representation |
---|---|
bin | 101101011010000001000… |
… | …010100110111000110101 |
3 | 102001022001212000112220212 |
4 | 231122001002212320311 |
5 | 402110344131420313 |
6 | 10345241242035205 |
7 | 441302135411024 |
oct | 55320102467065 |
9 | 12038055015825 |
10 | 3120311201333 |
11 | aa3353365a87 |
12 | 4248a1aa8b05 |
13 | 198323337671 |
14 | ab0496ca8bb |
15 | 56276bbc3a8 |
hex | 2d6810a6e35 |
3120311201333 has 32 divisors (see below), whose sum is σ = 3346071552000. Its totient is φ = 2903273876160.
The previous prime is 3120311201311. The next prime is 3120311201339. The reversal of 3120311201333 is 3331021130213.
It is a cyclic number.
It is not a de Polignac number, because 3120311201333 - 216 = 3120311135797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3120311201299 and 3120311201308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3120311201339) 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 31 ways as a sum of consecutive naturals, for example, 209704988 + ... + 209719866.
It is an arithmetic number, because the mean of its divisors is an integer number (104564736000).
Almost surely, 23120311201333 is an apocalyptic number.
It is an amenable number.
3120311201333 is a deficient number, since it is larger than the sum of its proper divisors (225760350667).
3120311201333 is a wasteful number, since it uses less digits than its factorization.
3120311201333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15905.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 3120311201333 its reverse (3331021130213), we get a palindrome (6451332331546).
The spelling of 3120311201333 in words is "three trillion, one hundred twenty billion, three hundred eleven million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •