Base | Representation |
---|---|
bin | 11101011011011011101… |
… | …100001110100001011001 |
3 | 21011022221222200100012201 |
4 | 131123123230032201121 |
5 | 231113203012330431 |
6 | 4145012521210201 |
7 | 266051662025323 |
oct | 35333354164131 |
9 | 7138858610181 |
10 | 2022320433241 |
11 | 70a730187729 |
12 | 287b33030961 |
13 | 11891c8b9814 |
14 | 6dc49002613 |
15 | 37912804461 |
hex | 1d6dbb0e859 |
2022320433241 has 4 divisors (see below), whose sum is σ = 2128758350800. Its totient is φ = 1915882515684.
The previous prime is 2022320433227. The next prime is 2022320433299. The reversal of 2022320433241 is 1423340232202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2022320433241 - 221 = 2022318336089 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2022320403241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53218958751 + ... + 53218958788.
It is an arithmetic number, because the mean of its divisors is an integer number (532189587700).
Almost surely, 22022320433241 is an apocalyptic number.
It is an amenable number.
2022320433241 is a deficient number, since it is larger than the sum of its proper divisors (106437917559).
2022320433241 is a wasteful number, since it uses less digits than its factorization.
2022320433241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106437917558.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 2022320433241 its reverse (1423340232202), we get a palindrome (3445660665443).
The spelling of 2022320433241 in words is "two trillion, twenty-two billion, three hundred twenty million, four hundred thirty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •