Base | Representation |
---|---|
bin | 1001101101010101010001… |
… | …0010101010111010011111 |
3 | 1101210110111211200211102210 |
4 | 2123111110102222322133 |
5 | 2344342141411123241 |
6 | 34411431051051503 |
7 | 2151125531116542 |
oct | 233252422527237 |
9 | 41713454624383 |
10 | 10674407911071 |
11 | 3445a99a914a3 |
12 | 1244931740b93 |
13 | 5c5791503178 |
14 | 28c9035a2859 |
15 | 1379ec36e316 |
hex | 9b5544aae9f |
10674407911071 has 8 divisors (see below), whose sum is σ = 14312055300480. Its totient is φ = 7076516231192.
The previous prime is 10674407911043. The next prime is 10674407911163. The reversal of 10674407911071 is 17011970447601.
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 10674407911071 - 214 = 10674407894687 is a prime.
It is a super-2 number, since 2×106744079110712 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10674407911071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10674407911001) 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, 9938926755 + ... + 9938927828.
It is an arithmetic number, because the mean of its divisors is an integer number (1789006912560).
Almost surely, 210674407911071 is an apocalyptic number.
10674407911071 is a deficient number, since it is larger than the sum of its proper divisors (3637647389409).
10674407911071 is a wasteful number, since it uses less digits than its factorization.
10674407911071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19877854765.
The product of its (nonzero) digits is 296352, while the sum is 48.
The spelling of 10674407911071 in words is "ten trillion, six hundred seventy-four billion, four hundred seven million, nine hundred eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •