Base | Representation |
---|---|
bin | 1001110101010010001010… |
… | …01000111011010010111001 |
3 | 2211120001020010021222112221 |
4 | 10322221011020323102321 |
5 | 10313223401441222433 |
6 | 113553004334204041 |
7 | 4361065641626335 |
oct | 472510510732271 |
9 | 84501203258487 |
10 | 21622025335993 |
11 | 6986938687445 |
12 | 25125b0653621 |
13 | c0ac4338cb64 |
14 | 54a723c027c5 |
15 | 277689e0072d |
hex | 13aa4523b4b9 |
21622025335993 has 2 divisors, whose sum is σ = 21622025335994. Its totient is φ = 21622025335992.
The previous prime is 21622025335991. The next prime is 21622025336003. The reversal of 21622025335993 is 39953352022612.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17075010724864 + 4547014611129 = 4132192^2 + 2132373^2 .
It is a cyclic number.
It is not a de Polignac number, because 21622025335993 - 21 = 21622025335991 is a prime.
Together with 21622025335991, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 21622025335993.
It is not a weakly prime, because it can be changed into another prime (21622025335991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10811012667996 + 10811012667997.
It is an arithmetic number, because the mean of its divisors is an integer number (10811012667997).
Almost surely, 221622025335993 is an apocalyptic number.
It is an amenable number.
21622025335993 is a deficient number, since it is larger than the sum of its proper divisors (1).
21622025335993 is an equidigital number, since it uses as much as digits as its factorization.
21622025335993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5248800, while the sum is 52.
The spelling of 21622025335993 in words is "twenty-one trillion, six hundred twenty-two billion, twenty-five million, three hundred thirty-five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •