Base | Representation |
---|---|
bin | 1001010010111000011110… |
… | …1110111111111110110001 |
3 | 1100012000121200101212220021 |
4 | 2110232013232333332301 |
5 | 2314421032114121113 |
6 | 33423001043443441 |
7 | 2103241144265611 |
oct | 224560756777661 |
9 | 40160550355807 |
10 | 10220004442033 |
11 | 3290309088641 |
12 | 1190856986581 |
13 | 591985a49139 |
14 | 274917d30a41 |
15 | 12aca470e48d |
hex | 94b87bbffb1 |
10220004442033 has 8 divisors (see below), whose sum is σ = 10573998684480. Its totient is φ = 9866115552720.
The previous prime is 10220004442031. The next prime is 10220004442051. The reversal of 10220004442033 is 33024440002201.
It is a happy number.
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 10220004442033 - 21 = 10220004442031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220004441989 and 10220004442007.
It is not an unprimeable number, because it can be changed into a prime (10220004442031) 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, 26140885 + ... + 26528962.
It is an arithmetic number, because the mean of its divisors is an integer number (1321749835560).
Almost surely, 210220004442033 is an apocalyptic number.
It is an amenable number.
10220004442033 is a deficient number, since it is larger than the sum of its proper divisors (353994242447).
10220004442033 is an equidigital number, since it uses as much as digits as its factorization.
10220004442033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52676567.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 10220004442033 its reverse (33024440002201), we get a palindrome (43244444444234).
The spelling of 10220004442033 in words is "ten trillion, two hundred twenty billion, four million, four hundred forty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •