Base | Representation |
---|---|
bin | 11101001100101001001… |
… | …01110100011100110101 |
3 | 10112220111011000201220222 |
4 | 32212110211310130311 |
5 | 112414043400301401 |
6 | 2044512325104125 |
7 | 132323510016134 |
oct | 16462445643465 |
9 | 3486434021828 |
10 | 1003220322101 |
11 | 357510799618 |
12 | 142520558045 |
13 | 737ac50128a |
14 | 367b000191b |
15 | 1b16932ac1b |
hex | e994974735 |
1003220322101 has 16 divisors (see below), whose sum is σ = 1025646028800. Its totient is φ = 981082672128.
The previous prime is 1003220322089. The next prime is 1003220322109. The reversal of 1003220322101 is 1012230223001.
It is a cyclic number.
It is not a de Polignac number, because 1003220322101 - 26 = 1003220322037 is a prime.
It is a super-3 number, since 3×10032203221013 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1003220322101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003220322109) 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, 3347900 + ... + 3635226.
It is an arithmetic number, because the mean of its divisors is an integer number (64102876800).
Almost surely, 21003220322101 is an apocalyptic number.
It is an amenable number.
1003220322101 is a deficient number, since it is larger than the sum of its proper divisors (22425706699).
1003220322101 is a wasteful number, since it uses less digits than its factorization.
1003220322101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287828.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1003220322101 its reverse (1012230223001), we get a palindrome (2015450545102).
The spelling of 1003220322101 in words is "one trillion, three billion, two hundred twenty million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •