Base | Representation |
---|---|
bin | 1010011000101111010100… |
… | …0010010101001011100011 |
3 | 1111102202100210002101112202 |
4 | 2212023311002111023203 |
5 | 2444101413312223411 |
6 | 40142200455243415 |
7 | 2256035366134355 |
oct | 246136502251343 |
9 | 44382323071482 |
10 | 11420134101731 |
11 | 3703284a83a03 |
12 | 134536b97956b |
13 | 64abb6160754 |
14 | 2b6a4776b0d5 |
15 | 14c0e59ac83b |
hex | a62f50952e3 |
11420134101731 has 8 divisors (see below), whose sum is σ = 11430687180000. Its totient is φ = 11409583281408.
The previous prime is 11420134101671. The next prime is 11420134101913. The reversal of 11420134101731 is 13710143102411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11420134101731 is a prime.
It is a super-2 number, since 2×114201341017312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11420134101694 and 11420134101703.
It is not an unprimeable number, because it can be changed into a prime (11420134101931) 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, 9640805 + ... + 10760361.
It is an arithmetic number, because the mean of its divisors is an integer number (1428835897500).
Almost surely, 211420134101731 is an apocalyptic number.
11420134101731 is a deficient number, since it is larger than the sum of its proper divisors (10553078269).
11420134101731 is a wasteful number, since it uses less digits than its factorization.
11420134101731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1128973.
The product of its (nonzero) digits is 2016, while the sum is 29.
The spelling of 11420134101731 in words is "eleven trillion, four hundred twenty billion, one hundred thirty-four million, one hundred one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •