Base | Representation |
---|---|
bin | 1001100000010010001001… |
… | …1001100111101110101111 |
3 | 1101000000212200020201102012 |
4 | 2120010202121213232233 |
5 | 2332204034014312342 |
6 | 34120434235351435 |
7 | 2126001335151104 |
oct | 230044231475657 |
9 | 41000780221365 |
10 | 10450232572847 |
11 | 3369a11939931 |
12 | 12093a98b257b |
13 | 5aa5b6786942 |
14 | 281b18882aab |
15 | 131c7b821b82 |
hex | 98122667baf |
10450232572847 has 2 divisors, whose sum is σ = 10450232572848. Its totient is φ = 10450232572846.
The previous prime is 10450232572807. The next prime is 10450232572883. The reversal of 10450232572847 is 74827523205401.
10450232572847 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (74827523205401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10450232572847 - 222 = 10450228378543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10450232572795 and 10450232572804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10450232572807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5225116286423 + 5225116286424.
It is an arithmetic number, because the mean of its divisors is an integer number (5225116286424).
Almost surely, 210450232572847 is an apocalyptic number.
10450232572847 is a deficient number, since it is larger than the sum of its proper divisors (1).
10450232572847 is an equidigital number, since it uses as much as digits as its factorization.
10450232572847 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3763200, while the sum is 50.
The spelling of 10450232572847 in words is "ten trillion, four hundred fifty billion, two hundred thirty-two million, five hundred seventy-two thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •