Base | Representation |
---|---|
bin | 10111010010011011110… |
… | …111111100011110110001 |
3 | 12122222202122122001221201 |
4 | 113102123313330132301 |
5 | 202210000244440431 |
6 | 3223104251451201 |
7 | 223422663533323 |
oct | 27223367743661 |
9 | 5588678561851 |
10 | 1600342968241 |
11 | 567779980616 |
12 | 21a1a7756b01 |
13 | b7bb0cb9724 |
14 | 57658087613 |
15 | 2b96677e461 |
hex | 1749bdfc7b1 |
1600342968241 has 2 divisors, whose sum is σ = 1600342968242. Its totient is φ = 1600342968240.
The previous prime is 1600342968239. The next prime is 1600342968269. The reversal of 1600342968241 is 1428692430061.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1600235120016 + 107848225 = 1265004^2 + 10385^2 .
It is a cyclic number.
It is not a de Polignac number, because 1600342968241 - 21 = 1600342968239 is a prime.
It is a super-2 number, since 2×16003429682412 (a number of 25 digits) contains 22 as substring.
Together with 1600342968239, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1600342968191 and 1600342968200.
It is not a weakly prime, because it can be changed into another prime (1600342969241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 800171484120 + 800171484121.
It is an arithmetic number, because the mean of its divisors is an integer number (800171484121).
Almost surely, 21600342968241 is an apocalyptic number.
It is an amenable number.
1600342968241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1600342968241 is an equidigital number, since it uses as much as digits as its factorization.
1600342968241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 497664, while the sum is 46.
The spelling of 1600342968241 in words is "one trillion, six hundred billion, three hundred forty-two million, nine hundred sixty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •