Base | Representation |
---|---|
bin | 1100010011000100… |
… | …0111101110010111 |
3 | 22112001210220012020 |
4 | 3010301013232113 |
5 | 23230102223111 |
6 | 1303324224223 |
7 | 144543554646 |
oct | 30461075627 |
9 | 8461726166 |
10 | 3301211031 |
11 | 14444a1788 |
12 | 78169b073 |
13 | 407c17611 |
14 | 23461335d |
15 | 144c41906 |
hex | c4c47b97 |
3301211031 has 16 divisors (see below), whose sum is σ = 4634582400. Its totient is φ = 2084388768.
The previous prime is 3301211029. The next prime is 3301211057. The reversal of 3301211031 is 1301121033.
It is not a de Polignac number, because 3301211031 - 21 = 3301211029 is a prime.
It is a super-2 number, since 2×33012110312 = 21795988542392165922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3301211031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3301211231) 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, 292980 + ... + 304038.
It is an arithmetic number, because the mean of its divisors is an integer number (289661400).
Almost surely, 23301211031 is an apocalyptic number.
3301211031 is a deficient number, since it is larger than the sum of its proper divisors (1333371369).
3301211031 is a wasteful number, since it uses less digits than its factorization.
3301211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16318.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 3301211031 is about 57456.1661703946. The cubic root of 3301211031 is about 1488.9876508497.
Adding to 3301211031 its reverse (1301121033), we get a palindrome (4602332064).
The spelling of 3301211031 in words is "three billion, three hundred one million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •