Base | Representation |
---|---|
bin | 1010001000011100111100… |
… | …0000000101011001001010 |
3 | 1110110000010021022221212122 |
4 | 2202013033000011121022 |
5 | 2430010340203314310 |
6 | 35405443242411242 |
7 | 2226601406660630 |
oct | 242071700053112 |
9 | 43400107287778 |
10 | 11140323104330 |
11 | 3605647a68122 |
12 | 12bb09b800b22 |
13 | 62a6b2c13234 |
14 | 2a72a1a6d350 |
15 | 144bba950555 |
hex | a21cf00564a |
11140323104330 has 64 divisors (see below), whose sum is σ = 23657709477888. Its totient is φ = 3696139702080.
The previous prime is 11140323104329. The next prime is 11140323104363. The reversal of 11140323104330 is 3340132304111.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11140323104330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46150529 + ... + 46391291.
It is an arithmetic number, because the mean of its divisors is an integer number (369651710592).
Almost surely, 211140323104330 is an apocalyptic number.
11140323104330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11140323104330 is an abundant number, since it is smaller than the sum of its proper divisors (12517386373558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11140323104330 is a wasteful number, since it uses less digits than its factorization.
11140323104330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262131.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 11140323104330 its reverse (3340132304111), we get a palindrome (14480455408441).
The spelling of 11140323104330 in words is "eleven trillion, one hundred forty billion, three hundred twenty-three million, one hundred four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •