Base | Representation |
---|---|
bin | 1100110001100111010010… |
… | …1100011100100011010101 |
3 | 1211201211110210111201021111 |
4 | 3030121310230130203111 |
5 | 3320114213210210021 |
6 | 45512512354015021 |
7 | 2646553246242163 |
oct | 314316454344325 |
9 | 54654423451244 |
10 | 14046500866261 |
11 | 45260a6602776 |
12 | 16aa380877471 |
13 | 7ab76ba9b726 |
14 | 367bd6188233 |
15 | 1955ad4a78e1 |
hex | cc674b1c8d5 |
14046500866261 has 2 divisors, whose sum is σ = 14046500866262. Its totient is φ = 14046500866260.
The previous prime is 14046500866259. The next prime is 14046500866291. The reversal of 14046500866261 is 16266800564041.
14046500866261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7639557800625 + 6406943065636 = 2763975^2 + 2531194^2 .
It is a cyclic number.
It is not a de Polignac number, because 14046500866261 - 21 = 14046500866259 is a prime.
Together with 14046500866259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14046500866291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7023250433130 + 7023250433131.
It is an arithmetic number, because the mean of its divisors is an integer number (7023250433131).
Almost surely, 214046500866261 is an apocalyptic number.
It is an amenable number.
14046500866261 is a deficient number, since it is larger than the sum of its proper divisors (1).
14046500866261 is an equidigital number, since it uses as much as digits as its factorization.
14046500866261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1658880, while the sum is 49.
The spelling of 14046500866261 in words is "fourteen trillion, forty-six billion, five hundred million, eight hundred sixty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •