Base | Representation |
---|---|
bin | 1010010010111111100011… |
… | …0111011010110001110010 |
3 | 1111002022112210222210202020 |
4 | 2210233320313122301302 |
5 | 2440442224002232010 |
6 | 40024552535132310 |
7 | 2245642124031426 |
oct | 244577067326162 |
9 | 44068483883666 |
10 | 11321414102130 |
11 | 3675426126080 |
12 | 132a1ba814096 |
13 | 6417b28a5ac2 |
14 | 2b1d60702b86 |
15 | 149768d12470 |
hex | a4bf8ddac72 |
11321414102130 has 32 divisors (see below), whose sum is σ = 29641520559168. Its totient is φ = 2744585236800.
The previous prime is 11321414102129. The next prime is 11321414102137. The reversal of 11321414102130 is 3120141412311.
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 11321414102130.
It is not an unprimeable number, because it can be changed into a prime (11321414102137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17153657401 + ... + 17153658060.
It is an arithmetic number, because the mean of its divisors is an integer number (926297517474).
Almost surely, 211321414102130 is an apocalyptic number.
11321414102130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11321414102130 is an abundant number, since it is smaller than the sum of its proper divisors (18320106457038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321414102130 is a wasteful number, since it uses less digits than its factorization.
11321414102130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34307315482.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 11321414102130 its reverse (3120141412311), we get a palindrome (14441555514441).
The spelling of 11321414102130 in words is "eleven trillion, three hundred twenty-one billion, four hundred fourteen million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •