Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …100110011001001011001 |
3 | 11022122021221201001002020 |
4 | 101300103230303021121 |
5 | 124442231403114001 |
6 | 2332301243325053 |
7 | 154102150164513 |
oct | 21602354631131 |
9 | 4278257631066 |
10 | 1220101223001 |
11 | 430495372491 |
12 | 178569520789 |
13 | 8b093c439bb |
14 | 430a603cbb3 |
15 | 21b0e79d736 |
hex | 11c13b33259 |
1220101223001 has 4 divisors (see below), whose sum is σ = 1626801630672. Its totient is φ = 813400815332.
The previous prime is 1220101222997. The next prime is 1220101223023. The reversal of 1220101223001 is 1003221010221.
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 1220101223001 - 22 = 1220101222997 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1220101223401) 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, 203350203831 + ... + 203350203836.
It is an arithmetic number, because the mean of its divisors is an integer number (406700407668).
Almost surely, 21220101223001 is an apocalyptic number.
It is an amenable number.
1220101223001 is a deficient number, since it is larger than the sum of its proper divisors (406700407671).
1220101223001 is an equidigital number, since it uses as much as digits as its factorization.
1220101223001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406700407670.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1220101223001 its reverse (1003221010221), we get a palindrome (2223322233222).
The spelling of 1220101223001 in words is "one trillion, two hundred twenty billion, one hundred one million, two hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •