Base | Representation |
---|---|
bin | 1011110101111111100011… |
… | …0111100110111101000110 |
3 | 1201002220121222121111210011 |
4 | 2331133320313212331012 |
5 | 3201324002111414342 |
6 | 43410154214020434 |
7 | 2512552531605532 |
oct | 275377067467506 |
9 | 51086558544704 |
10 | 13022221201222 |
11 | 417076941a102 |
12 | 156396364771a |
13 | 735cb45a87ac |
14 | 3303c9306bc2 |
15 | 178b1040b717 |
hex | bd7f8de6f46 |
13022221201222 has 8 divisors (see below), whose sum is σ = 19824874067736. Its totient is φ = 6413929845312.
The previous prime is 13022221201189. The next prime is 13022221201271. The reversal of 13022221201222 is 22210212222031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×130222212012222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13022221201193 and 13022221201202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48590377483 + ... + 48590377750.
It is an arithmetic number, because the mean of its divisors is an integer number (2478109258467).
Almost surely, 213022221201222 is an apocalyptic number.
13022221201222 is a deficient number, since it is larger than the sum of its proper divisors (6802652866514).
13022221201222 is an equidigital number, since it uses as much as digits as its factorization.
13022221201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97180755302.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 13022221201222 its reverse (22210212222031), we get a palindrome (35232433423253).
The spelling of 13022221201222 in words is "thirteen trillion, twenty-two billion, two hundred twenty-one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •