Base | Representation |
---|---|
bin | 11011110110100010101… |
… | …110001010010010001101 |
3 | 20202222100021201100000111 |
4 | 123312202232022102031 |
5 | 222324323024101321 |
6 | 4023135230000021 |
7 | 255165316306246 |
oct | 33664256122215 |
9 | 6688307640014 |
10 | 1913990456461 |
11 | 67879a7957a6 |
12 | 26ab3b646011 |
13 | 10b6473a1945 |
14 | 688cd93dccd |
15 | 34bc213d5e1 |
hex | 1bda2b8a48d |
1913990456461 has 2 divisors, whose sum is σ = 1913990456462. Its totient is φ = 1913990456460.
The previous prime is 1913990456359. The next prime is 1913990456471. The reversal of 1913990456461 is 1646540993191.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1143798165225 + 770192291236 = 1069485^2 + 877606^2 .
It is an emirp because it is prime and its reverse (1646540993191) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1913990456461 - 215 = 1913990423693 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1913990456396 and 1913990456405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1913990456471) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 956995228230 + 956995228231.
It is an arithmetic number, because the mean of its divisors is an integer number (956995228231).
Almost surely, 21913990456461 is an apocalyptic number.
It is an amenable number.
1913990456461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1913990456461 is an equidigital number, since it uses as much as digits as its factorization.
1913990456461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6298560, while the sum is 58.
The spelling of 1913990456461 in words is "one trillion, nine hundred thirteen billion, nine hundred ninety million, four hundred fifty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •