Base | Representation |
---|---|
bin | 111100010100100001111… |
… | …111101110011001001101 |
3 | 112200021112002001202021222 |
4 | 330110201333232121031 |
5 | 1020403344212400434 |
6 | 12452141313333125 |
7 | 605324155614461 |
oct | 74244177563115 |
9 | 15607462052258 |
10 | 4145213793869 |
11 | 1358a80137265 |
12 | 56b4538671a5 |
13 | 240b798c2c55 |
14 | 1048b51a24a1 |
15 | 72c5e7b472e |
hex | 3c521fee64d |
4145213793869 has 2 divisors, whose sum is σ = 4145213793870. Its totient is φ = 4145213793868.
The previous prime is 4145213793839. The next prime is 4145213793871. The reversal of 4145213793869 is 9683973125414.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2711834965225 + 1433378828644 = 1646765^2 + 1197238^2 .
It is a cyclic number.
It is not a de Polignac number, because 4145213793869 - 216 = 4145213728333 is a prime.
It is a super-2 number, since 2×41452137938692 (a number of 26 digits) contains 22 as substring.
Together with 4145213793871, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4145213793839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2072606896934 + 2072606896935.
It is an arithmetic number, because the mean of its divisors is an integer number (2072606896935).
Almost surely, 24145213793869 is an apocalyptic number.
It is an amenable number.
4145213793869 is a deficient number, since it is larger than the sum of its proper divisors (1).
4145213793869 is an equidigital number, since it uses as much as digits as its factorization.
4145213793869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 39191040, while the sum is 62.
The spelling of 4145213793869 in words is "four trillion, one hundred forty-five billion, two hundred thirteen million, seven hundred ninety-three thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •