Base | Representation |
---|---|
bin | 11101001000111010101… |
… | …11111101101101101001 |
3 | 10112201022202110002000120 |
4 | 32210131113331231221 |
5 | 112400444332420241 |
6 | 2043542035353453 |
7 | 132223112202204 |
oct | 16443527755551 |
9 | 3481282402016 |
10 | 1001220201321 |
11 | 35668477a23a |
12 | 142062752889 |
13 | 73551013c62 |
14 | 3666051493b |
15 | 1b09d942666 |
hex | e91d5fdb69 |
1001220201321 has 16 divisors (see below), whose sum is σ = 1335783412224. Its totient is φ = 667068692864.
The previous prime is 1001220201313. The next prime is 1001220201329. The reversal of 1001220201321 is 1231020221001.
It is an interprime number because it is at equal distance from previous prime (1001220201313) and next prime (1001220201329).
It is a cyclic number.
It is not a de Polignac number, because 1001220201321 - 23 = 1001220201313 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001220201321.
It is not an unprimeable number, because it can be changed into a prime (1001220201329) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40169755 + ... + 40194671.
It is an arithmetic number, because the mean of its divisors is an integer number (83486463264).
Almost surely, 21001220201321 is an apocalyptic number.
It is an amenable number.
1001220201321 is a deficient number, since it is larger than the sum of its proper divisors (334563210903).
1001220201321 is a wasteful number, since it uses less digits than its factorization.
1001220201321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32640.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1001220201321 its reverse (1231020221001), we get a palindrome (2232240422322).
The spelling of 1001220201321 in words is "one trillion, one billion, two hundred twenty million, two hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •