Base | Representation |
---|---|
bin | 10001110001001111010… |
… | …111001110100010101001 |
3 | 11022201212201012222202111 |
4 | 101301033113032202221 |
5 | 130001304130413001 |
6 | 2332544442002321 |
7 | 154136023310644 |
oct | 21611727164251 |
9 | 4281781188674 |
10 | 1221102201001 |
11 | 4309593a4031 |
12 | 1787a87a63a1 |
13 | 8b1c3434087 |
14 | 4315cd62a5b |
15 | 21b6c5c4851 |
hex | 11c4f5ce8a9 |
1221102201001 has 4 divisors (see below), whose sum is σ = 1221104467072. Its totient is φ = 1221099934932.
The previous prime is 1221102200959. The next prime is 1221102201017. The reversal of 1221102201001 is 1001022011221.
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 1221102201001 - 29 = 1221102200489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1221102201041) 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, 191020 + ... + 1574386.
It is an arithmetic number, because the mean of its divisors is an integer number (305276116768).
Almost surely, 21221102201001 is an apocalyptic number.
It is an amenable number.
1221102201001 is a deficient number, since it is larger than the sum of its proper divisors (2266071).
1221102201001 is an equidigital number, since it uses as much as digits as its factorization.
1221102201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2266070.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1221102201001 its reverse (1001022011221), we get a palindrome (2222124212222).
It can be divided in two parts, 122110220 and 1001, that added together give a palindrome (122111221).
The spelling of 1221102201001 in words is "one trillion, two hundred twenty-one billion, one hundred two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •