Base | Representation |
---|---|
bin | 1010011001010100100101… |
… | …1100110001101100101111 |
3 | 1111110201012010102122101211 |
4 | 2212111021130301230233 |
5 | 2444232411401130043 |
6 | 40150533422015251 |
7 | 2256541350055060 |
oct | 246251134615457 |
9 | 44421163378354 |
10 | 11430140255023 |
11 | 370754a210a86 |
12 | 13472a2a17527 |
13 | 64bb1c1c3909 |
14 | 2b7316652567 |
15 | 14c4ce183a9d |
hex | a6549731b2f |
11430140255023 has 8 divisors (see below), whose sum is σ = 13277165261600. Its totient is φ = 9636652205280.
The previous prime is 11430140255011. The next prime is 11430140255077. The reversal of 11430140255023 is 32055204103411.
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 11430140255023 - 217 = 11430140123951 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 (11430140255003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13384238748 + ... + 13384239601.
It is an arithmetic number, because the mean of its divisors is an integer number (1659645657700).
Almost surely, 211430140255023 is an apocalyptic number.
11430140255023 is a deficient number, since it is larger than the sum of its proper divisors (1847025006577).
11430140255023 is an equidigital number, since it uses as much as digits as its factorization.
11430140255023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26768478417.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 11430140255023 its reverse (32055204103411), we get a palindrome (43485344358434).
The spelling of 11430140255023 in words is "eleven trillion, four hundred thirty billion, one hundred forty million, two hundred fifty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •