Base | Representation |
---|---|
bin | 11101001000111010111… |
… | …11101000001000110101 |
3 | 10112201022220020010112211 |
4 | 32210131133220020311 |
5 | 112401000341210401 |
6 | 2043542150413421 |
7 | 132223135236541 |
oct | 16443537501065 |
9 | 3481286203484 |
10 | 1001222210101 |
11 | 356685921493 |
12 | 142063361271 |
13 | 73551568399 |
14 | 366608b8a21 |
15 | 1b09dbdc951 |
hex | e91d7e8235 |
1001222210101 has 8 divisors (see below), whose sum is σ = 1002517453080. Its totient is φ = 999927264768.
The previous prime is 1001222210077. The next prime is 1001222210117. The reversal of 1001222210101 is 1010122221001.
It can be written as a sum of positive squares in 4 ways, for example, as 485161006225 + 516061203876 = 696535^2 + 718374^2 .
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 1001222210101 - 225 = 1001188655669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001222910101) 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, 7102435 + ... + 7242031.
It is an arithmetic number, because the mean of its divisors is an integer number (125314681635).
Almost surely, 21001222210101 is an apocalyptic number.
It is an amenable number.
1001222210101 is a deficient number, since it is larger than the sum of its proper divisors (1295242979).
1001222210101 is an equidigital number, since it uses as much as digits as its factorization.
1001222210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148823.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1001222210101 its reverse (1010122221001), we get a palindrome (2011344431102).
The spelling of 1001222210101 in words is "one trillion, one billion, two hundred twenty-two million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •