Base | Representation |
---|---|
bin | 10000101100100011100… |
… | …101110111011001111011 |
3 | 11001200112000211120101001 |
4 | 100230203211313121323 |
5 | 122244234432144414 |
6 | 2235030433105431 |
7 | 145615325650105 |
oct | 20544345673173 |
9 | 4050460746331 |
10 | 1147353396859 |
11 | 402654098a1a |
12 | 1664463b8277 |
13 | 8426c438b27 |
14 | 3d764504575 |
15 | 1eca2d0c074 |
hex | 10b2397767b |
1147353396859 has 2 divisors, whose sum is σ = 1147353396860. Its totient is φ = 1147353396858.
The previous prime is 1147353396851. The next prime is 1147353396919. The reversal of 1147353396859 is 9586933537411.
It is a weak prime.
It is an emirp because it is prime and its reverse (9586933537411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1147353396859 - 23 = 1147353396851 is a prime.
It is a super-3 number, since 3×11473533968593 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1147353396859.
It is not a weakly prime, because it can be changed into another prime (1147353396851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 573676698429 + 573676698430.
It is an arithmetic number, because the mean of its divisors is an integer number (573676698430).
Almost surely, 21147353396859 is an apocalyptic number.
1147353396859 is a deficient number, since it is larger than the sum of its proper divisors (1).
1147353396859 is an equidigital number, since it uses as much as digits as its factorization.
1147353396859 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 73483200, while the sum is 64.
The spelling of 1147353396859 in words is "one trillion, one hundred forty-seven billion, three hundred fifty-three million, three hundred ninety-six thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •