Base | Representation |
---|---|
bin | 1001101001011001000100… |
… | …00100110011101001010001 |
3 | 2210002222112101011101002211 |
4 | 10310230202010303221101 |
5 | 10240030033240113101 |
6 | 113041150340112121 |
7 | 4316422126505512 |
oct | 464544204635121 |
9 | 83088471141084 |
10 | 21213415160401 |
11 | 6839616909752 |
12 | 2467375995641 |
13 | bab554c8c379 |
14 | 534a40300a09 |
15 | 26bc2267dc51 |
hex | 134b22133a51 |
21213415160401 has 2 divisors, whose sum is σ = 21213415160402. Its totient is φ = 21213415160400.
The previous prime is 21213415160389. The next prime is 21213415160419. The reversal of 21213415160401 is 10406151431212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20846082194001 + 367332966400 = 4565751^2 + 606080^2 .
It is a cyclic number.
It is not a de Polignac number, because 21213415160401 - 215 = 21213415127633 is a prime.
It is not a weakly prime, because it can be changed into another prime (21213415164401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606707580200 + 10606707580201.
It is an arithmetic number, because the mean of its divisors is an integer number (10606707580201).
Almost surely, 221213415160401 is an apocalyptic number.
It is an amenable number.
21213415160401 is a deficient number, since it is larger than the sum of its proper divisors (1).
21213415160401 is an equidigital number, since it uses as much as digits as its factorization.
21213415160401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 31.
Adding to 21213415160401 its reverse (10406151431212), we get a palindrome (31619566591613).
The spelling of 21213415160401 in words is "twenty-one trillion, two hundred thirteen billion, four hundred fifteen million, one hundred sixty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •