Base | Representation |
---|---|
bin | 1001111011010001111001… |
… | …0000111001111001000111 |
3 | 1102122100222210110012022122 |
4 | 2132310132100321321013 |
5 | 2412303403012201142 |
6 | 35113455330120155 |
7 | 2204340403222346 |
oct | 236643620717107 |
9 | 42570883405278 |
10 | 10914019647047 |
11 | 3528678621180 |
12 | 128326312005b |
13 | 61225931206a |
14 | 29a354463b5d |
15 | 13dd731841d2 |
hex | 9ed1e439e47 |
10914019647047 has 8 divisors (see below), whose sum is σ = 11906260214160. Its totient is φ = 9921788573760.
The previous prime is 10914019646987. The next prime is 10914019647061. The reversal of 10914019647047 is 74074691041901.
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 10914019647047 - 26 = 10914019646983 is a prime.
It is a super-2 number, since 2×109140196470472 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10914019647047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10914019647247) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146579 + ... + 4674347.
It is an arithmetic number, because the mean of its divisors is an integer number (1488282526770).
Almost surely, 210914019647047 is an apocalyptic number.
10914019647047 is a deficient number, since it is larger than the sum of its proper divisors (992240567113).
10914019647047 is a wasteful number, since it uses less digits than its factorization.
10914019647047 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4746913.
The product of its (nonzero) digits is 1524096, while the sum is 53.
The spelling of 10914019647047 in words is "ten trillion, nine hundred fourteen billion, nineteen million, six hundred forty-seven thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •