Base | Representation |
---|---|
bin | 1000110001000011011… |
… | …01100110011111110011 |
3 | 1001210111001222201022001 |
4 | 10120201231212133303 |
5 | 14413341102004021 |
6 | 350213034354431 |
7 | 30522226626142 |
oct | 4304155463763 |
9 | 1053431881261 |
10 | 301213313011 |
11 | 106820076326 |
12 | 4a46388ba17 |
13 | 225343048c0 |
14 | 10816339759 |
15 | 7c7de79091 |
hex | 4621b667f3 |
301213313011 has 32 divisors (see below), whose sum is σ = 335707545600. Its totient is φ = 268490046720.
The previous prime is 301213313003. The next prime is 301213313029. The reversal of 301213313011 is 110313312103.
It is a cyclic number.
It is not a de Polignac number, because 301213313011 - 23 = 301213313003 is a prime.
It is a super-2 number, since 2×3012133130112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 301213313011.
It is not an unprimeable number, because it can be changed into a prime (301213313041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21266550 + ... + 21280708.
It is an arithmetic number, because the mean of its divisors is an integer number (10490860800).
Almost surely, 2301213313011 is an apocalyptic number.
301213313011 is a deficient number, since it is larger than the sum of its proper divisors (34494232589).
301213313011 is a wasteful number, since it uses less digits than its factorization.
301213313011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14619.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 301213313011 its reverse (110313312103), we get a palindrome (411526625114).
It can be divided in two parts, 301 and 213313011, that added together give a palindrome (213313312).
The spelling of 301213313011 in words is "three hundred one billion, two hundred thirteen million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •