Base | Representation |
---|---|
bin | 110000001111000011000101… |
… | …101000100000011000110001 |
3 | 1000211010102022001221212100000 |
4 | 300033003011220200120301 |
5 | 210301201404121222001 |
6 | 2031103532121420213 |
7 | 62453430253220136 |
oct | 6017030550403061 |
9 | 1024112261855300 |
10 | 212140340414001 |
11 | 6165a23874937a |
12 | 1b96227693a669 |
13 | 914a995c1b64c |
14 | 3a5590c12458d |
15 | 197d3cca24a86 |
hex | c0f0c5a20631 |
212140340414001 has 12 divisors (see below), whose sum is σ = 317774007863312. Its totient is φ = 141426893609172.
The previous prime is 212140340413993. The next prime is 212140340414077. The reversal of 212140340414001 is 100414043041212.
212140340414001 is a `hidden beast` number, since 2 + 1 + 214 + 0 + 3 + 4 + 0 + 41 + 400 + 1 = 666.
It is not a de Polignac number, because 212140340414001 - 23 = 212140340413993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (212140340514001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 436502757811 + ... + 436502758296.
Almost surely, 2212140340414001 is an apocalyptic number.
It is an amenable number.
212140340414001 is a deficient number, since it is larger than the sum of its proper divisors (105633667449311).
212140340414001 is an frugal number, since it uses more digits than its factorization.
212140340414001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 873005516122 (or 873005516110 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 212140340414001 its reverse (100414043041212), we get a palindrome (312554383455213).
The spelling of 212140340414001 in words is "two hundred twelve trillion, one hundred forty billion, three hundred forty million, four hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •