Base | Representation |
---|---|
bin | 110000010010000001001001… |
… | …110011011000011011010001 |
3 | 1000211211221001211012001222220 |
4 | 300102001021303120123101 |
5 | 210313022333324223101 |
6 | 2031341402551451253 |
7 | 62504243466260346 |
oct | 6022011163303321 |
9 | 1024757054161886 |
10 | 212344421320401 |
11 | 61728844033997 |
12 | 1b995931086b29 |
13 | 9163cba849026 |
14 | 3a6174c1ba7cd |
15 | 19838743a1636 |
hex | c12049cd86d1 |
212344421320401 has 24 divisors (see below), whose sum is σ = 285977155971936. Its totient is φ = 140151254100480.
The previous prime is 212344421320393. The next prime is 212344421320403. The reversal of 212344421320401 is 104023124443212.
It is not a de Polignac number, because 212344421320401 - 23 = 212344421320393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212344421320403) 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 in 23 ways as a sum of consecutive naturals, for example, 30686221 + ... + 36963941.
It is an arithmetic number, because the mean of its divisors is an integer number (11915714832164).
Almost surely, 2212344421320401 is an apocalyptic number.
It is an amenable number.
212344421320401 is a deficient number, since it is larger than the sum of its proper divisors (73632734651535).
212344421320401 is an equidigital number, since it uses as much as digits as its factorization.
212344421320401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6278833 (or 6278720 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 212344421320401 its reverse (104023124443212), we get a palindrome (316367545763613).
The spelling of 212344421320401 in words is "two hundred twelve trillion, three hundred forty-four billion, four hundred twenty-one million, three hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •