Base | Representation |
---|---|
bin | 1011100011101000… |
… | …0000011111110101 |
3 | 22000012100210202202 |
4 | 2320322000133311 |
5 | 22323131323013 |
6 | 1231455114245 |
7 | 136606246034 |
oct | 27072003765 |
9 | 8005323682 |
10 | 3102214133 |
11 | 1352134437 |
12 | 726b12985 |
13 | 3a5921a85 |
14 | 21601271b |
15 | 132534858 |
hex | b8e807f5 |
3102214133 has 16 divisors (see below), whose sum is σ = 3164663040. Its totient is φ = 3040574976.
The previous prime is 3102214127. The next prime is 3102214139. The reversal of 3102214133 is 3314122013.
It is an interprime number because it is at equal distance from previous prime (3102214127) and next prime (3102214139).
It is a cyclic number.
It is not a de Polignac number, because 3102214133 - 222 = 3098019829 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3102214139) 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, 7066328 + ... + 7066766.
It is an arithmetic number, because the mean of its divisors is an integer number (197791440).
Almost surely, 23102214133 is an apocalyptic number.
It is an amenable number.
3102214133 is a deficient number, since it is larger than the sum of its proper divisors (62448907).
3102214133 is a wasteful number, since it uses less digits than its factorization.
3102214133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 3102214133 is about 55697.5235804968. The cubic root of 3102214133 is about 1458.4467958726.
Adding to 3102214133 its reverse (3314122013), we get a palindrome (6416336146).
The spelling of 3102214133 in words is "three billion, one hundred two million, two hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •