Base | Representation |
---|---|
bin | 1000110001000100011… |
… | …00000111101100110011 |
3 | 1001210111122001011200012 |
4 | 10120202030013230303 |
5 | 14413400124011311 |
6 | 350213522045135 |
7 | 30522354626531 |
oct | 4304214075463 |
9 | 1053448034605 |
10 | 301221313331 |
11 | 106824640064 |
12 | 4a4664a97ab |
13 | 22535b76213 |
14 | 1081741d151 |
15 | 7c7ea0978b |
hex | 4622307b33 |
301221313331 has 16 divisors (see below), whose sum is σ = 314229552000. Its totient is φ = 288397065600.
The previous prime is 301221313301. The next prime is 301221313363. The reversal of 301221313331 is 133313122103.
It is a de Polignac number, because none of the positive numbers 2k-301221313331 is a prime.
It is a super-2 number, since 2×3012213133312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 301221313297 and 301221313306.
It is not an unprimeable number, because it can be changed into a prime (301221313301) 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 15 ways as a sum of consecutive naturals, for example, 1749686 + ... + 1914116.
It is an arithmetic number, because the mean of its divisors is an integer number (19639347000).
Almost surely, 2301221313331 is an apocalyptic number.
301221313331 is a deficient number, since it is larger than the sum of its proper divisors (13008238669).
301221313331 is a wasteful number, since it uses less digits than its factorization.
301221313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164990.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 301221313331 its reverse (133313122103), we get a palindrome (434534435434).
The spelling of 301221313331 in words is "three hundred one billion, two hundred twenty-one million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •