Base | Representation |
---|---|
bin | 1010011001010110100001… |
… | …0001100110110011001101 |
3 | 1111110202112011120101001111 |
4 | 2212111220101212303031 |
5 | 2444234441244423433 |
6 | 40151101014412021 |
7 | 2256560226644113 |
oct | 246255021466315 |
9 | 44422464511044 |
10 | 11430657420493 |
11 | 3707795132063 |
12 | 1347408061011 |
13 | 64bba23a8b9c |
14 | 2b73651d5ab3 |
15 | 14c50e78cdcd |
hex | a6568466ccd |
11430657420493 has 8 divisors (see below), whose sum is σ = 12032706984320. Its totient is φ = 10828651458240.
The previous prime is 11430657420487. The next prime is 11430657420499. The reversal of 11430657420493 is 39402475603411.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11430657420487) and next prime (11430657420499).
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-11430657420493 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11430657420499) 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, 10361580 + ... + 11411557.
It is an arithmetic number, because the mean of its divisors is an integer number (1504088373040).
Almost surely, 211430657420493 is an apocalyptic number.
It is an amenable number.
11430657420493 is a deficient number, since it is larger than the sum of its proper divisors (602049563827).
11430657420493 is a wasteful number, since it uses less digits than its factorization.
11430657420493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21800787.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 11430657420493 in words is "eleven trillion, four hundred thirty billion, six hundred fifty-seven million, four hundred twenty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •