Base | Representation |
---|---|
bin | 1011010000100000… |
… | …0001010010011111 |
3 | 21210121102120110111 |
4 | 2310020001102133 |
5 | 22142113020221 |
6 | 1215511550451 |
7 | 134613405310 |
oct | 26410012237 |
9 | 7717376414 |
10 | 3022001311 |
11 | 131092834a |
12 | 70408b427 |
13 | 392118874 |
14 | 2094d2607 |
15 | 12a48cbe1 |
hex | b420149f |
3022001311 has 8 divisors (see below), whose sum is σ = 3656875680. Its totient is φ = 2437916928.
The previous prime is 3022001273. The next prime is 3022001317. The reversal of 3022001311 is 1131002203.
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 3022001311 - 227 = 2887783583 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3022001291 and 3022001300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3022001317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12697366 + ... + 12697603.
It is an arithmetic number, because the mean of its divisors is an integer number (457109460).
Almost surely, 23022001311 is an apocalyptic number.
3022001311 is a deficient number, since it is larger than the sum of its proper divisors (634874369).
3022001311 is a wasteful number, since it uses less digits than its factorization.
3022001311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25394993.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 3022001311 is about 54972.7324316338. The cubic root of 3022001311 is about 1445.7666953767.
Adding to 3022001311 its reverse (1131002203), we get a palindrome (4153003514).
The spelling of 3022001311 in words is "three billion, twenty-two million, one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •