Base | Representation |
---|---|
bin | 1011000110010100100000… |
… | …0011101001010011111101 |
3 | 1121012121121202102122111211 |
4 | 2301211020003221103331 |
5 | 3044414134004100013 |
6 | 41542024443044421 |
7 | 2366436642024463 |
oct | 261451003512375 |
9 | 47177552378454 |
10 | 12203211003133 |
11 | 39853975241a7 |
12 | 1451092810711 |
13 | 6a69b10308c7 |
14 | 3028d2310833 |
15 | 16267821823d |
hex | b19480e94fd |
12203211003133 has 4 divisors (see below), whose sum is σ = 12596862971008. Its totient is φ = 11809559035260.
The previous prime is 12203211003101. The next prime is 12203211003157. The reversal of 12203211003133 is 33130011230221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12203211003133 - 25 = 12203211003101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203211003233) 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, 196825983891 + ... + 196825983952.
It is an arithmetic number, because the mean of its divisors is an integer number (3149215742752).
Almost surely, 212203211003133 is an apocalyptic number.
It is an amenable number.
12203211003133 is a deficient number, since it is larger than the sum of its proper divisors (393651967875).
12203211003133 is an equidigital number, since it uses as much as digits as its factorization.
12203211003133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393651967874.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12203211003133 its reverse (33130011230221), we get a palindrome (45333222233354).
The spelling of 12203211003133 in words is "twelve trillion, two hundred three billion, two hundred eleven million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •