Base | Representation |
---|---|
bin | 1011000110010100001101… |
… | …0111001100010110010101 |
3 | 1121012121102021020010120221 |
4 | 2301211003113030112111 |
5 | 3044414003323210201 |
6 | 41542012550554341 |
7 | 2366434664406241 |
oct | 261450327142625 |
9 | 47177367203527 |
10 | 12203132241301 |
11 | 3985357019281 |
12 | 14510703689b1 |
13 | 6a699a914c81 |
14 | 3028c5a8b421 |
15 | 16267135b4a1 |
hex | b19435cc595 |
12203132241301 has 4 divisors (see below), whose sum is σ = 12204932385600. Its totient is φ = 12201332097004.
The previous prime is 12203132241241. The next prime is 12203132241323. The reversal of 12203132241301 is 10314223130221.
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 12203132241301 - 235 = 12168772502933 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 (12203532241301) 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, 900061981 + ... + 900075538.
It is an arithmetic number, because the mean of its divisors is an integer number (3051233096400).
Almost surely, 212203132241301 is an apocalyptic number.
It is an amenable number.
12203132241301 is a deficient number, since it is larger than the sum of its proper divisors (1800144299).
12203132241301 is an equidigital number, since it uses as much as digits as its factorization.
12203132241301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1800144298.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 12203132241301 its reverse (10314223130221), we get a palindrome (22517355371522).
The spelling of 12203132241301 in words is "twelve trillion, two hundred three billion, one hundred thirty-two million, two hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •