Base | Representation |
---|---|
bin | 1001100111100100110101… |
… | …00101111110001110110001 |
3 | 2202220000110102202102011012 |
4 | 10303302122211332032301 |
5 | 10233014233212022433 |
6 | 112552350245000305 |
7 | 4312052544545546 |
oct | 463623245761661 |
9 | 82800412672135 |
10 | 21151012610993 |
11 | 6815104238771 |
12 | 245725b3b3095 |
13 | ba56bb863015 |
14 | 531a00726bcd |
15 | 26a2be04e848 |
hex | 133c9a97e3b1 |
21151012610993 has 2 divisors, whose sum is σ = 21151012610994. Its totient is φ = 21151012610992.
The previous prime is 21151012610983. The next prime is 21151012611101. The reversal of 21151012610993 is 39901621015112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15149041799329 + 6001970811664 = 3892177^2 + 2449892^2 .
It is a cyclic number.
It is not a de Polignac number, because 21151012610993 - 24 = 21151012610977 is a prime.
It is a super-3 number, since 3×211510126109933 (a number of 41 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21151012610993.
It is not a weakly prime, because it can be changed into another prime (21151012610983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10575506305496 + 10575506305497.
It is an arithmetic number, because the mean of its divisors is an integer number (10575506305497).
Almost surely, 221151012610993 is an apocalyptic number.
It is an amenable number.
21151012610993 is a deficient number, since it is larger than the sum of its proper divisors (1).
21151012610993 is an equidigital number, since it uses as much as digits as its factorization.
21151012610993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 41.
The spelling of 21151012610993 in words is "twenty-one trillion, one hundred fifty-one billion, twelve million, six hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •