Base | Representation |
---|---|
bin | 11101101111111111110… |
… | …00011000110101010101 |
3 | 10121201110220001111112221 |
4 | 32313333320120311111 |
5 | 113221431224033023 |
6 | 2101331534142341 |
7 | 133565034342316 |
oct | 16677770306525 |
9 | 3551426044487 |
10 | 1022200221013 |
11 | 364570415594 |
12 | 1461389519b1 |
13 | 755157515aa |
14 | 37690a2660d |
15 | 1b8ca74485d |
hex | edffe18d55 |
1022200221013 has 8 divisors (see below), whose sum is σ = 1026566620376. Its totient is φ = 1017834854400.
The previous prime is 1022200220959. The next prime is 1022200221017. The reversal of 1022200221013 is 3101220022201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 195697410129 + 826502810884 = 442377^2 + 909122^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 1022200221013 - 213 = 1022200212821 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 (1022200221017) 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, 1759183 + ... + 2266963.
It is an arithmetic number, because the mean of its divisors is an integer number (128320827547).
Almost surely, 21022200221013 is an apocalyptic number.
It is an amenable number.
1022200221013 is a deficient number, since it is larger than the sum of its proper divisors (4366399363).
1022200221013 is an equidigital number, since it uses as much as digits as its factorization.
1022200221013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 516375.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1022200221013 its reverse (3101220022201), we get a palindrome (4123420243214).
The spelling of 1022200221013 in words is "one trillion, twenty-two billion, two hundred million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •