Base | Representation |
---|---|
bin | 1011101110000111… |
… | …0100011110110011 |
3 | 22010021010210001002 |
4 | 2323201310132303 |
5 | 22420412030412 |
6 | 1240110032215 |
7 | 140652205433 |
oct | 27341643663 |
9 | 8107123032 |
10 | 3146205107 |
11 | 1374a50511 |
12 | 7397a866b |
13 | 3b1a85036 |
14 | 21bbc42c3 |
15 | 136323dc2 |
hex | bb8747b3 |
3146205107 has 2 divisors, whose sum is σ = 3146205108. Its totient is φ = 3146205106.
The previous prime is 3146205059. The next prime is 3146205109. The reversal of 3146205107 is 7015026413.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3146205107 - 26 = 3146205043 is a prime.
Together with 3146205109, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3146205107.
It is not a weakly prime, because it can be changed into another prime (3146205109) 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 as a sum of consecutive naturals, namely, 1573102553 + 1573102554.
It is an arithmetic number, because the mean of its divisors is an integer number (1573102554).
Almost surely, 23146205107 is an apocalyptic number.
3146205107 is a deficient number, since it is larger than the sum of its proper divisors (1).
3146205107 is an equidigital number, since it uses as much as digits as its factorization.
3146205107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 3146205107 is about 56091.0430193627. The cubic root of 3146205107 is about 1465.3083032180.
The spelling of 3146205107 in words is "three billion, one hundred forty-six million, two hundred five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •