Base | Representation |
---|---|
bin | 1001011110111001110000… |
… | …1001000100100110101111 |
3 | 1100220202122002002220011022 |
4 | 2113232130021010212233 |
5 | 2331311440321014442 |
6 | 34101512000444355 |
7 | 2124201343225301 |
oct | 227563411044657 |
9 | 40822562086138 |
10 | 10426505251247 |
11 | 335a946439a38 |
12 | 12048876196bb |
13 | 5a82a4b10587 |
14 | 280907547971 |
15 | 13133d7443d2 |
hex | 97b9c2449af |
10426505251247 has 8 divisors (see below), whose sum is σ = 10433923821600. Its totient is φ = 10419088492800.
The previous prime is 10426505251237. The next prime is 10426505251259. The reversal of 10426505251247 is 74215250562401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10426505251247 - 232 = 10422210283951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10426505251198 and 10426505251207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10426505251237) 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 in 7 ways as a sum of consecutive naturals, for example, 11165798 + ... + 12063500.
It is an arithmetic number, because the mean of its divisors is an integer number (1304240477700).
Almost surely, 210426505251247 is an apocalyptic number.
10426505251247 is a deficient number, since it is larger than the sum of its proper divisors (7418570353).
10426505251247 is an equidigital number, since it uses as much as digits as its factorization.
10426505251247 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905953.
The product of its (nonzero) digits is 672000, while the sum is 44.
The spelling of 10426505251247 in words is "ten trillion, four hundred twenty-six billion, five hundred five million, two hundred fifty-one thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •