Base | Representation |
---|---|
bin | 1011011100101110… |
… | …11011000101111101 |
3 | 120212100220200220112 |
4 | 11232113123011331 |
5 | 100042012220331 |
6 | 2453530555405 |
7 | 305214151346 |
oct | 55627330575 |
9 | 16770820815 |
10 | 6146601341 |
11 | 2674661621 |
12 | 1236598b65 |
13 | 76c577a1a |
14 | 4244910cd |
15 | 25e94532b |
hex | 16e5db17d |
6146601341 has 2 divisors, whose sum is σ = 6146601342. Its totient is φ = 6146601340.
The previous prime is 6146601317. The next prime is 6146601371. The reversal of 6146601341 is 1431066416.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4154318116 + 1992283225 = 64454^2 + 44635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6146601341 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6146601298 and 6146601307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6146601371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3073300670 + 3073300671.
It is an arithmetic number, because the mean of its divisors is an integer number (3073300671).
Almost surely, 26146601341 is an apocalyptic number.
It is an amenable number.
6146601341 is a deficient number, since it is larger than the sum of its proper divisors (1).
6146601341 is an equidigital number, since it uses as much as digits as its factorization.
6146601341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 6146601341 is about 78400.2636538934. The cubic root of 6146601341 is about 1831.8012405098.
Adding to 6146601341 its reverse (1431066416), we get a palindrome (7577667757).
The spelling of 6146601341 in words is "six billion, one hundred forty-six million, six hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •