Base | Representation |
---|---|
bin | 10001110001100001001… |
… | …110111011000101010001 |
3 | 11022202122121101001220212 |
4 | 101301201032323011101 |
5 | 130002412403422113 |
6 | 2333034312013505 |
7 | 154146323551265 |
oct | 21614116730521 |
9 | 4282577331825 |
10 | 1221402014033 |
11 | 430aa265aaa3 |
12 | 178871091295 |
13 | 8b240597a36 |
14 | 4318aac80a5 |
15 | 21b88a980a8 |
hex | 11c613bb151 |
1221402014033 has 4 divisors (see below), whose sum is σ = 1221430271088. Its totient is φ = 1221373756980.
The previous prime is 1221402014029. The next prime is 1221402014059. The reversal of 1221402014033 is 3304102041221.
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 1221402014033 - 22 = 1221402014029 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221402014003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14063591 + ... + 14150172.
It is an arithmetic number, because the mean of its divisors is an integer number (305357567772).
Almost surely, 21221402014033 is an apocalyptic number.
It is an amenable number.
1221402014033 is a deficient number, since it is larger than the sum of its proper divisors (28257055).
1221402014033 is an equidigital number, since it uses as much as digits as its factorization.
1221402014033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28257054.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1221402014033 its reverse (3304102041221), we get a palindrome (4525504055254).
The spelling of 1221402014033 in words is "one trillion, two hundred twenty-one billion, four hundred two million, fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •