Base | Representation |
---|---|
bin | 1010010011100000000001… |
… | …1001100000001110000111 |
3 | 1111010011001021021020122101 |
4 | 2210320000121200032013 |
5 | 2441113101341144143 |
6 | 40032553504012531 |
7 | 2246401123323664 |
oct | 244700031401607 |
9 | 44104037236571 |
10 | 11330130412423 |
11 | 3679099272aa9 |
12 | 132ba31901147 |
13 | 642571649164 |
14 | 2b254a18ca6b |
15 | 149ac9152b4d |
hex | a4e00660387 |
11330130412423 has 8 divisors (see below), whose sum is σ = 11416727367936. Its totient is φ = 11243535084600.
The previous prime is 11330130412417. The next prime is 11330130412441. The reversal of 11330130412423 is 32421403103311.
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 11330130412423 - 237 = 11192691458951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11330130412391 and 11330130412400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11330130412723) 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, 16124140 + ... + 16812142.
It is an arithmetic number, because the mean of its divisors is an integer number (1427090920992).
Almost surely, 211330130412423 is an apocalyptic number.
11330130412423 is a deficient number, since it is larger than the sum of its proper divisors (86596955513).
11330130412423 is a wasteful number, since it uses less digits than its factorization.
11330130412423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 813845.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 11330130412423 its reverse (32421403103311), we get a palindrome (43751533515734).
The spelling of 11330130412423 in words is "eleven trillion, three hundred thirty billion, one hundred thirty million, four hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •