Base | Representation |
---|---|
bin | 1011101110001010… |
… | …0011100111000011 |
3 | 22010021111120211201 |
4 | 2323202203213003 |
5 | 22420434220042 |
6 | 1240114122031 |
7 | 140653641304 |
oct | 27342434703 |
9 | 8107446751 |
10 | 3146398147 |
11 | 1375072552 |
12 | 739880317 |
13 | 3b1b21b69 |
14 | 21bc347ab |
15 | 1363611b7 |
hex | bb8a39c3 |
3146398147 has 4 divisors (see below), whose sum is σ = 3147012256. Its totient is φ = 3145784040.
The previous prime is 3146398111. The next prime is 3146398169. The reversal of 3146398147 is 7418936413.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7418936413 = 7 ⋅1059848059.
It is a cyclic number.
It is not a de Polignac number, because 3146398147 - 227 = 3012180419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3146398097 and 3146398106.
It is not an unprimeable number, because it can be changed into a prime (3146398187) 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 3 ways as a sum of consecutive naturals, for example, 299304 + ... + 309637.
It is an arithmetic number, because the mean of its divisors is an integer number (786753064).
Almost surely, 23146398147 is an apocalyptic number.
3146398147 is a deficient number, since it is larger than the sum of its proper divisors (614109).
3146398147 is an equidigital number, since it uses as much as digits as its factorization.
3146398147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614108.
The product of its digits is 435456, while the sum is 46.
The square root of 3146398147 is about 56092.7637668176. The cubic root of 3146398147 is about 1465.3382713140.
The spelling of 3146398147 in words is "three billion, one hundred forty-six million, three hundred ninety-eight thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •