Base | Representation |
---|---|
bin | 100100010111001… |
… | …1001000110101001 |
3 | 10011000212120100201 |
4 | 1020232121012221 |
5 | 4444322333001 |
6 | 321023232201 |
7 | 42143600041 |
oct | 11056310651 |
9 | 3130776321 |
10 | 1220121001 |
11 | 5767a9a70 |
12 | 2a0748661 |
13 | 165a1a9b8 |
14 | b808a721 |
15 | 721b2501 |
hex | 48b991a9 |
1220121001 has 8 divisors (see below), whose sum is σ = 1361996064. Its totient is φ = 1083405120.
The previous prime is 1220120989. The next prime is 1220121017. The reversal of 1220121001 is 1001210221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1220121001 - 27 = 1220120873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1220121061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1289296 + ... + 1290241.
It is an arithmetic number, because the mean of its divisors is an integer number (170249508).
Almost surely, 21220121001 is an apocalyptic number.
1220121001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1220121001 is a deficient number, since it is larger than the sum of its proper divisors (141875063).
1220121001 is a wasteful number, since it uses less digits than its factorization.
1220121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2579591.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1220121001 is about 34930.2304744758. The cubic root of 1220121001 is about 1068.5650549827.
Adding to 1220121001 its reverse (1001210221), we get a palindrome (2221331222).
It can be divided in two parts, 1220 and 121001, that added together give a palindrome (122221).
The spelling of 1220121001 in words is "one billion, two hundred twenty million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •