Base | Representation |
---|---|
bin | 1001000110111100100101… |
… | …1000011011011000000001 |
3 | 1022110102022220101101111121 |
4 | 2101233021120123120001 |
5 | 2303041103013002402 |
6 | 33144445303312241 |
7 | 2052361506151534 |
oct | 221571130333001 |
9 | 38412286341447 |
10 | 10014947390977 |
11 | 3211351793101 |
12 | 1158b6974b681 |
13 | 578536b14779 |
14 | 268a2437aa1b |
15 | 1257a2314837 |
hex | 91bc961b601 |
10014947390977 has 4 divisors (see below), whose sum is σ = 10164424217776. Its totient is φ = 9865470564180.
The previous prime is 10014947390969. The next prime is 10014947390989. The reversal of 10014947390977 is 77909374941001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10014947390977 - 23 = 10014947390969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10014947390177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74738413299 + ... + 74738413432.
It is an arithmetic number, because the mean of its divisors is an integer number (2541106054444).
Almost surely, 210014947390977 is an apocalyptic number.
It is an amenable number.
10014947390977 is a deficient number, since it is larger than the sum of its proper divisors (149476826799).
10014947390977 is an equidigital number, since it uses as much as digits as its factorization.
10014947390977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149476826798.
The product of its (nonzero) digits is 12002256, while the sum is 61.
The spelling of 10014947390977 in words is "ten trillion, fourteen billion, nine hundred forty-seven million, three hundred ninety thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •