Base | Representation |
---|---|
bin | 1011100011100100… |
… | …1111011100100111 |
3 | 22000011222121011122 |
4 | 2320321033130213 |
5 | 22323103410343 |
6 | 1231450524155 |
7 | 136604451221 |
oct | 27071173447 |
9 | 8004877148 |
10 | 3102013223 |
11 | 13520074a1 |
12 | 726a3665b |
13 | 3a58814aa |
14 | 215d9d411 |
15 | 1324e5068 |
hex | b8e4f727 |
3102013223 has 4 divisors (see below), whose sum is σ = 3102366408. Its totient is φ = 3101660040.
The previous prime is 3102013193. The next prime is 3102013231. The reversal of 3102013223 is 3223102013.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3223102013 = 71 ⋅45395803.
It is a cyclic number.
It is not a de Polignac number, because 3102013223 - 214 = 3101996839 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 (3102013253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 163073 + ... + 181098.
It is an arithmetic number, because the mean of its divisors is an integer number (775591602).
Almost surely, 23102013223 is an apocalyptic number.
3102013223 is a deficient number, since it is larger than the sum of its proper divisors (353185).
3102013223 is an equidigital number, since it uses as much as digits as its factorization.
3102013223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353184.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 3102013223 is about 55695.7199702096. The cubic root of 3102013223 is about 1458.4153105250.
Adding to 3102013223 its reverse (3223102013), we get a palindrome (6325115236).
The spelling of 3102013223 in words is "three billion, one hundred two million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •