Base | Representation |
---|---|
bin | 1011010010111010… |
… | …0010110100000111 |
3 | 21211022102122101211 |
4 | 2310232202310013 |
5 | 22202204200403 |
6 | 1220512232251 |
7 | 135065265664 |
oct | 26456426407 |
9 | 7738378354 |
10 | 3032100103 |
11 | 13165a575a |
12 | 70753b687 |
13 | 394243396 |
14 | 20a9a0a6b |
15 | 12b2d506d |
hex | b4ba2d07 |
3032100103 has 2 divisors, whose sum is σ = 3032100104. Its totient is φ = 3032100102.
The previous prime is 3032100091. The next prime is 3032100109. The reversal of 3032100103 is 3010012303.
3032100103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (3010012303) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3032100103 is a prime.
It is a super-2 number, since 2×30321001032 = 18387262069225221218, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3032100109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1516050051 + 1516050052.
It is an arithmetic number, because the mean of its divisors is an integer number (1516050052).
Almost surely, 23032100103 is an apocalyptic number.
3032100103 is a deficient number, since it is larger than the sum of its proper divisors (1).
3032100103 is an equidigital number, since it uses as much as digits as its factorization.
3032100103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 3032100103 is about 55064.5085604148. The cubic root of 3032100103 is about 1447.3753714377.
Adding to 3032100103 its reverse (3010012303), we get a palindrome (6042112406).
The spelling of 3032100103 in words is "three billion, thirty-two million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •