Base | Representation |
---|---|
bin | 1010010010011100011111… |
… | …1011011010011101010110 |
3 | 1111001102020221120221122011 |
4 | 2210213013323122131112 |
5 | 2440313440300144342 |
6 | 40020355033254434 |
7 | 2245156661063443 |
oct | 244470773323526 |
9 | 44042227527564 |
10 | 11312003131222 |
11 | 3671436956372 |
12 | 1328412b6441a |
13 | 640942c42771 |
14 | 2b170a8ac9ca |
15 | 1493b7a06717 |
hex | a49c7eda756 |
11312003131222 has 4 divisors (see below), whose sum is σ = 16968004696836. Its totient is φ = 5656001565610.
The previous prime is 11312003131217. The next prime is 11312003131241. The reversal of 11312003131222 is 22213130021311.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×113120031312222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11312003131193 and 11312003131202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2828000782804 + ... + 2828000782807.
It is an arithmetic number, because the mean of its divisors is an integer number (4242001174209).
Almost surely, 211312003131222 is an apocalyptic number.
11312003131222 is a deficient number, since it is larger than the sum of its proper divisors (5656001565614).
11312003131222 is an equidigital number, since it uses as much as digits as its factorization.
11312003131222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5656001565613.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11312003131222 its reverse (22213130021311), we get a palindrome (33525133152533).
The spelling of 11312003131222 in words is "eleven trillion, three hundred twelve billion, three million, one hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •