Base | Representation |
---|---|
bin | 11111001101110111010… |
… | …111011011000010010101 |
3 | 21121002010001220120112001 |
4 | 133031313113123002111 |
5 | 240121322433400321 |
6 | 4321253130355301 |
7 | 310661561162254 |
oct | 37156727330225 |
9 | 7532101816461 |
10 | 2145191309461 |
11 | 757852629622 |
12 | 2a790428bb31 |
13 | 1273a17b86c5 |
14 | 75b8373c79b |
15 | 3ac04844c91 |
hex | 1f3775db095 |
2145191309461 has 2 divisors, whose sum is σ = 2145191309462. Its totient is φ = 2145191309460.
The previous prime is 2145191309419. The next prime is 2145191309507. The reversal of 2145191309461 is 1649031915412.
It is an a-pointer prime, because the next prime (2145191309507) can be obtained adding 2145191309461 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1084682673361 + 1060508636100 = 1041481^2 + 1029810^2 .
It is a cyclic number.
It is not a de Polignac number, because 2145191309461 - 213 = 2145191301269 is a prime.
It is a super-2 number, since 2×21451913094612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2145191309761) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1072595654730 + 1072595654731.
It is an arithmetic number, because the mean of its divisors is an integer number (1072595654731).
Almost surely, 22145191309461 is an apocalyptic number.
It is an amenable number.
2145191309461 is a deficient number, since it is larger than the sum of its proper divisors (1).
2145191309461 is an equidigital number, since it uses as much as digits as its factorization.
2145191309461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 46.
The spelling of 2145191309461 in words is "two trillion, one hundred forty-five billion, one hundred ninety-one million, three hundred nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •