Base | Representation |
---|---|
bin | 1011000111010011110111… |
… | …1111011101000010010111 |
3 | 1121021020112021121220002002 |
4 | 2301310331333131002113 |
5 | 3100204003313020203 |
6 | 41553520435505515 |
7 | 2400611331103361 |
oct | 261647577350227 |
9 | 47236467556062 |
10 | 12220222001303 |
11 | 3991626814978 |
12 | 145443b75829b |
13 | 6a84923a4cb4 |
14 | 303667653d31 |
15 | 162d21863d88 |
hex | b1d3dfdd097 |
12220222001303 has 4 divisors (see below), whose sum is σ = 12236758161720. Its totient is φ = 12203685840888.
The previous prime is 12220222001279. The next prime is 12220222001329. The reversal of 12220222001303 is 30310022202221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12220222001303 - 216 = 12220221935767 is a prime.
It is a super-2 number, since 2×122202220013032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220222001363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8268079100 + ... + 8268080577.
It is an arithmetic number, because the mean of its divisors is an integer number (3059189540430).
Almost surely, 212220222001303 is an apocalyptic number.
12220222001303 is a deficient number, since it is larger than the sum of its proper divisors (16536160417).
12220222001303 is an equidigital number, since it uses as much as digits as its factorization.
12220222001303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16536160416.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 12220222001303 its reverse (30310022202221), we get a palindrome (42530244203524).
The spelling of 12220222001303 in words is "twelve trillion, two hundred twenty billion, two hundred twenty-two million, one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •