Base | Representation |
---|---|
bin | 1001101001110101100011… |
… | …1000010011010100001001 |
3 | 1101120201111200012021022012 |
4 | 2122131120320103110021 |
5 | 2342401144431430401 |
6 | 34324100104105305 |
7 | 2143601422526153 |
oct | 232353070232411 |
9 | 41521450167265 |
10 | 10614355342601 |
11 | 3422582969a1a |
12 | 1235172165235 |
13 | 5bcc10bcb79a |
14 | 289a47b47ad3 |
15 | 1361851d58bb |
hex | 9a758e13509 |
10614355342601 has 2 divisors, whose sum is σ = 10614355342602. Its totient is φ = 10614355342600.
The previous prime is 10614355342583. The next prime is 10614355342637. The reversal of 10614355342601 is 10624355341601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7944477774025 + 2669877568576 = 2818595^2 + 1633976^2 .
It is an emirp because it is prime and its reverse (10624355341601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10614355342601 - 238 = 10339477435657 is a prime.
It is a super-2 number, since 2×106143553426012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10614355342691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5307177671300 + 5307177671301.
It is an arithmetic number, because the mean of its divisors is an integer number (5307177671301).
Almost surely, 210614355342601 is an apocalyptic number.
It is an amenable number.
10614355342601 is a deficient number, since it is larger than the sum of its proper divisors (1).
10614355342601 is an equidigital number, since it uses as much as digits as its factorization.
10614355342601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 10614355342601 in words is "ten trillion, six hundred fourteen billion, three hundred fifty-five million, three hundred forty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •