Base | Representation |
---|---|
bin | 11101101111101010100… |
… | …10101000001000011011 |
3 | 10121201000111201212210122 |
4 | 32313311102220020123 |
5 | 113221100233100133 |
6 | 2101302150103455 |
7 | 133560446224205 |
oct | 16676522501033 |
9 | 3551014655718 |
10 | 1022022550043 |
11 | 36448a0a3780 |
12 | 1460a934ab8b |
13 | 754b79b4841 |
14 | 376751b7775 |
15 | 1b8b9d4b498 |
hex | edf54a821b |
1022022550043 has 8 divisors (see below), whose sum is σ = 1115715021120. Its totient is φ = 928460300680.
The previous prime is 1022022550007. The next prime is 1022022550079. The reversal of 1022022550043 is 3400552202201.
It is an interprime number because it is at equal distance from previous prime (1022022550007) and next prime (1022022550079).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1022022550043 - 26 = 1022022549979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022022549994 and 1022022550021.
It is not an unprimeable number, because it can be changed into a prime (1022022550093) 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, 32539013 + ... + 32570406.
It is an arithmetic number, because the mean of its divisors is an integer number (139464377640).
Almost surely, 21022022550043 is an apocalyptic number.
1022022550043 is a deficient number, since it is larger than the sum of its proper divisors (93692471077).
1022022550043 is a wasteful number, since it uses less digits than its factorization.
1022022550043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65110857.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 1022022550043 its reverse (3400552202201), we get a palindrome (4422574752244).
The spelling of 1022022550043 in words is "one trillion, twenty-two billion, twenty-two million, five hundred fifty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •