Base | Representation |
---|---|
bin | 1010010111101100100101… |
… | …1110000011011001010110 |
3 | 1111101001010112202111121021 |
4 | 2211323021132003121112 |
5 | 2443303223131132410 |
6 | 40130035320511354 |
7 | 2254532502635125 |
oct | 245731136033126 |
9 | 44331115674537 |
10 | 11402223302230 |
11 | 36a6723887172 |
12 | 13419b161b55a |
13 | 6492c0562237 |
14 | 2b5c28b1dabc |
15 | 14b8e8373eda |
hex | a5ec9783656 |
11402223302230 has 32 divisors (see below), whose sum is σ = 21232563048000. Its totient is φ = 4403443696512.
The previous prime is 11402223302203. The next prime is 11402223302231. The reversal of 11402223302230 is 3220332220411.
It is a junction number, because it is equal to n+sod(n) for n = 11402223302195 and 11402223302204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11402223302231) 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 15 ways as a sum of consecutive naturals, for example, 6719704 + ... + 8243716.
It is an arithmetic number, because the mean of its divisors is an integer number (663517595250).
Almost surely, 211402223302230 is an apocalyptic number.
11402223302230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11402223302230 is a deficient number, since it is larger than the sum of its proper divisors (9830339745770).
11402223302230 is a wasteful number, since it uses less digits than its factorization.
11402223302230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549848.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 11402223302230 its reverse (3220332220411), we get a palindrome (14622555522641).
The spelling of 11402223302230 in words is "eleven trillion, four hundred two billion, two hundred twenty-three million, three hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •