Base | Representation |
---|---|
bin | 1011100011100110… |
… | …0100111000011101 |
3 | 22000012011001121102 |
4 | 2320321210320131 |
5 | 22323114213041 |
6 | 1231452442445 |
7 | 136605265205 |
oct | 27071447035 |
9 | 8005131542 |
10 | 3102101021 |
11 | 1352067458 |
12 | 726a79425 |
13 | 3a58b2446 |
14 | 215dc3405 |
15 | 13251109b |
hex | b8e64e1d |
3102101021 has 2 divisors, whose sum is σ = 3102101022. Its totient is φ = 3102101020.
The previous prime is 3102100933. The next prime is 3102101081. The reversal of 3102101021 is 1201012013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2987824921 + 114276100 = 54661^2 + 10690^2 .
It is a cyclic number.
It is not a de Polignac number, because 3102101021 - 214 = 3102084637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3102100993 and 3102101011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3102101081) 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 as a sum of consecutive naturals, namely, 1551050510 + 1551050511.
It is an arithmetic number, because the mean of its divisors is an integer number (1551050511).
Almost surely, 23102101021 is an apocalyptic number.
It is an amenable number.
3102101021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3102101021 is an equidigital number, since it uses as much as digits as its factorization.
3102101021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 3102101021 is about 55696.5081580524. The cubic root of 3102101021 is about 1458.4290698409.
Adding to 3102101021 its reverse (1201012013), we get a palindrome (4303113034).
The spelling of 3102101021 in words is "three billion, one hundred two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •