Base | Representation |
---|---|
bin | 1010000001100001010010… |
… | …1000000101000010000110 |
3 | 1110000121201121122202020012 |
4 | 2200120110220011002012 |
5 | 2421032440411212410 |
6 | 35235030101510222 |
7 | 2215154256264425 |
oct | 240302450050206 |
9 | 43017647582205 |
10 | 11021232132230 |
11 | 356a095241131 |
12 | 129bba4412372 |
13 | 61c3b41637c8 |
14 | 2a16053532bc |
15 | 141a4a6ab605 |
hex | a0614a05086 |
11021232132230 has 8 divisors (see below), whose sum is σ = 19838217838032. Its totient is φ = 4408492852888.
The previous prime is 11021232132223. The next prime is 11021232132271. The reversal of 11021232132230 is 3223123212011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11021232132196 and 11021232132205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551061606602 + ... + 551061606621.
It is an arithmetic number, because the mean of its divisors is an integer number (2479777229754).
Almost surely, 211021232132230 is an apocalyptic number.
11021232132230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11021232132230 is a deficient number, since it is larger than the sum of its proper divisors (8816985705802).
11021232132230 is a wasteful number, since it uses less digits than its factorization.
11021232132230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102123213230.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11021232132230 its reverse (3223123212011), we get a palindrome (14244355344241).
The spelling of 11021232132230 in words is "eleven trillion, twenty-one billion, two hundred thirty-two million, one hundred thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •