Base | Representation |
---|---|
bin | 1010000001010001111111… |
… | …01101100011000110001001 |
3 | 2220000110020211212012121012 |
4 | 11000220333231203012021 |
5 | 10342002121242231241 |
6 | 114510221211453305 |
7 | 4432631166244340 |
oct | 500507755430611 |
9 | 86013224765535 |
10 | 22034251133321 |
11 | 7025745373279 |
12 | 257a476157235 |
13 | c3aa898800ab |
14 | 56266b99cb57 |
15 | 283264cbc6eb |
hex | 140a3fb63189 |
22034251133321 has 8 divisors (see below), whose sum is σ = 25182045505344. Its totient is φ = 18886467813840.
The previous prime is 22034251133317. The next prime is 22034251133329. The reversal of 22034251133321 is 12333115243022.
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 22034251133321 - 22 = 22034251133317 is a prime.
It is a super-3 number, since 3×220342511333213 (a number of 41 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (22034251133329) 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, 2073191 + ... + 6954611.
It is an arithmetic number, because the mean of its divisors is an integer number (3147755688168).
Almost surely, 222034251133321 is an apocalyptic number.
It is an amenable number.
22034251133321 is a deficient number, since it is larger than the sum of its proper divisors (3147794372023).
22034251133321 is an equidigital number, since it uses as much as digits as its factorization.
22034251133321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5526271.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 22034251133321 its reverse (12333115243022), we get a palindrome (34367366376343).
The spelling of 22034251133321 in words is "twenty-two trillion, thirty-four billion, two hundred fifty-one million, one hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •