Base | Representation |
---|---|
bin | 11101110000101001110… |
… | …11101101000111010111 |
3 | 10121202101111122110120122 |
4 | 32320110323231013113 |
5 | 113223142133141210 |
6 | 2101430552222155 |
7 | 133606553406650 |
oct | 16702473550727 |
9 | 3552344573518 |
10 | 1022553412055 |
11 | 36473181a20a |
12 | 14621709a95b |
13 | 75570984086 |
14 | 376c58c4527 |
15 | 1b8eb75db55 |
hex | ee14eed1d7 |
1022553412055 has 8 divisors (see below), whose sum is σ = 1402358965152. Its totient is φ = 701179482528.
The previous prime is 1022553412021. The next prime is 1022553412099. The reversal of 1022553412055 is 5502143552201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022553412055 - 224 = 1022536634839 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 29215811773 = 1022553412055 / (1 + 0 + 2 + 2 + 5 + 5 + 3 + 4 + 1 + 2 + 0 + 5 + 5).
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14607905852 + ... + 14607905921.
It is an arithmetic number, because the mean of its divisors is an integer number (175294870644).
Almost surely, 21022553412055 is an apocalyptic number.
1022553412055 is a deficient number, since it is larger than the sum of its proper divisors (379805553097).
1022553412055 is an equidigital number, since it uses as much as digits as its factorization.
1022553412055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29215811785.
The product of its (nonzero) digits is 60000, while the sum is 35.
Adding to 1022553412055 its reverse (5502143552201), we get a palindrome (6524696964256).
The spelling of 1022553412055 in words is "one trillion, twenty-two billion, five hundred fifty-three million, four hundred twelve thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •