Base | Representation |
---|---|
bin | 101011010101011… |
… | …1110100010101001 |
3 | 10202100011021112011 |
4 | 1112222332202221 |
5 | 10434222404133 |
6 | 400142315521 |
7 | 51014463256 |
oct | 12652764251 |
9 | 3670137464 |
10 | 1454106793 |
11 | 686894a57 |
12 | 346b88ba1 |
13 | 1a2344229 |
14 | db19842d |
15 | 879d16cd |
hex | 56abe8a9 |
1454106793 has 2 divisors, whose sum is σ = 1454106794. Its totient is φ = 1454106792.
The previous prime is 1454106763. The next prime is 1454106817. The reversal of 1454106793 is 3976014541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1407975529 + 46131264 = 37523^2 + 6792^2 .
It is an emirp because it is prime and its reverse (3976014541) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1454106793 - 29 = 1454106281 is a prime.
It is a super-2 number, since 2×14541067932 = 4228853130897489698, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1454106763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 727053396 + 727053397.
It is an arithmetic number, because the mean of its divisors is an integer number (727053397).
Almost surely, 21454106793 is an apocalyptic number.
It is an amenable number.
1454106793 is a deficient number, since it is larger than the sum of its proper divisors (1).
1454106793 is an equidigital number, since it uses as much as digits as its factorization.
1454106793 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 40.
The square root of 1454106793 is about 38132.7522347916. The cubic root of 1454106793 is about 1132.9187585068.
The spelling of 1454106793 in words is "one billion, four hundred fifty-four million, one hundred six thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •