Base | Representation |
---|---|
bin | 1010011001111010110110… |
… | …0110010110010110111101 |
3 | 1111111200200212120010010020 |
4 | 2212132231212112112331 |
5 | 2444414430031430134 |
6 | 40155352455202353 |
7 | 2260354015041006 |
oct | 246365546262675 |
9 | 44450625503106 |
10 | 11440410420669 |
11 | 371093a48248a |
12 | 134928a3763b9 |
13 | 64ca97b643c9 |
14 | 2b7a0c6201ad |
15 | 14c8d0b0ab49 |
hex | a67ad9965bd |
11440410420669 has 8 divisors (see below), whose sum is σ = 15254189036352. Its totient is φ = 7626786042720.
The previous prime is 11440410420619. The next prime is 11440410420743. The reversal of 11440410420669 is 96602401404411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11440410420669 - 216 = 11440410355133 is a prime.
It is a super-2 number, since 2×114404104206692 (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 11440410420669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11440410420619) 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, 38386249 + ... + 38683134.
It is an arithmetic number, because the mean of its divisors is an integer number (1906773629544).
Almost surely, 211440410420669 is an apocalyptic number.
It is an amenable number.
11440410420669 is a deficient number, since it is larger than the sum of its proper divisors (3813778615683).
11440410420669 is an equidigital number, since it uses as much as digits as its factorization.
11440410420669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77118867.
The product of its (nonzero) digits is 165888, while the sum is 42.
The spelling of 11440410420669 in words is "eleven trillion, four hundred forty billion, four hundred ten million, four hundred twenty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •