Base | Representation |
---|---|
bin | 1001100001100010111011… |
… | …0001011100110010100111 |
3 | 1101002002211202112020221001 |
4 | 2120120232301130302213 |
5 | 2333032440213420232 |
6 | 34134421544534131 |
7 | 2130366546455443 |
oct | 230305661346247 |
9 | 41062752466831 |
10 | 10471914982567 |
11 | 3378129007205 |
12 | 121163b181347 |
13 | 5ac66088c48c |
14 | 282bb4391823 |
15 | 1325ea1196e7 |
hex | 9862ec5cca7 |
10471914982567 has 2 divisors, whose sum is σ = 10471914982568. Its totient is φ = 10471914982566.
The previous prime is 10471914982493. The next prime is 10471914982621. The reversal of 10471914982567 is 76528941917401.
10471914982567 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10471914982567 is a prime.
It is a super-2 number, since 2×104719149825672 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10471914982499 and 10471914982508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10471914986567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5235957491283 + 5235957491284.
It is an arithmetic number, because the mean of its divisors is an integer number (5235957491284).
Almost surely, 210471914982567 is an apocalyptic number.
10471914982567 is a deficient number, since it is larger than the sum of its proper divisors (1).
10471914982567 is an equidigital number, since it uses as much as digits as its factorization.
10471914982567 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30481920, while the sum is 64.
The spelling of 10471914982567 in words is "ten trillion, four hundred seventy-one billion, nine hundred fourteen million, nine hundred eighty-two thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •