Base | Representation |
---|---|
bin | 1001100111100110111101… |
… | …00101011101001101111101 |
3 | 2202220010101221012202121020 |
4 | 10303303132211131031331 |
5 | 10233024102222421321 |
6 | 112553055354254353 |
7 | 4312123035506613 |
oct | 463633645351575 |
9 | 82803357182536 |
10 | 21152153326461 |
11 | 681563a132123 |
12 | 24575194273b9 |
13 | ba5840c9b0a1 |
14 | 531aac0236b3 |
15 | 26a3392794c6 |
hex | 133cde95d37d |
21152153326461 has 4 divisors (see below), whose sum is σ = 28202871101952. Its totient is φ = 14101435550972.
The previous prime is 21152153326459. The next prime is 21152153326517. The reversal of 21152153326461 is 16462335125112.
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 21152153326461 - 21 = 21152153326459 is a prime.
It is a super-2 number, since 2×211521533264612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21152153326441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3525358887741 + ... + 3525358887746.
It is an arithmetic number, because the mean of its divisors is an integer number (7050717775488).
Almost surely, 221152153326461 is an apocalyptic number.
It is an amenable number.
21152153326461 is a deficient number, since it is larger than the sum of its proper divisors (7050717775491).
21152153326461 is an equidigital number, since it uses as much as digits as its factorization.
21152153326461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7050717775490.
The product of its digits is 259200, while the sum is 42.
The spelling of 21152153326461 in words is "twenty-one trillion, one hundred fifty-two billion, one hundred fifty-three million, three hundred twenty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •