Base | Representation |
---|---|
bin | 1001001011100101111111… |
… | …0010110010000101000111 |
3 | 1022202001101121002000210011 |
4 | 2102321133302302011013 |
5 | 2310343102223342242 |
6 | 33245251131411051 |
7 | 2061216031503403 |
oct | 222713762620507 |
9 | 38661347060704 |
10 | 10094780293447 |
11 | 324219933a353 |
12 | 11705295b3a87 |
13 | 582c1a4423b5 |
14 | 26c838c5a103 |
15 | 1278c5cc7d17 |
hex | 92e5fcb2147 |
10094780293447 has 2 divisors, whose sum is σ = 10094780293448. Its totient is φ = 10094780293446.
The previous prime is 10094780293439. The next prime is 10094780293469. The reversal of 10094780293447 is 74439208749001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10094780293447 - 23 = 10094780293439 is a prime.
It is a super-2 number, since 2×100947802934472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10094780293391 and 10094780293400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10094780293427) 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, 5047390146723 + 5047390146724.
It is an arithmetic number, because the mean of its divisors is an integer number (5047390146724).
Almost surely, 210094780293447 is an apocalyptic number.
10094780293447 is a deficient number, since it is larger than the sum of its proper divisors (1).
10094780293447 is an equidigital number, since it uses as much as digits as its factorization.
10094780293447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12192768, while the sum is 58.
The spelling of 10094780293447 in words is "ten trillion, ninety-four billion, seven hundred eighty million, two hundred ninety-three thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •