Base | Representation |
---|---|
bin | 110000101010101111010111… |
… | …001000000011110001011001 |
3 | 1001001212100011220102222110102 |
4 | 300222233113020003301121 |
5 | 211023341141412111301 |
6 | 2035122045300225145 |
7 | 63041055422260100 |
oct | 6052572710036131 |
9 | 1031770156388412 |
10 | 214043304410201 |
11 | 6222328a2732a2 |
12 | 2000b03969b1b5 |
13 | 9258273a5cb96 |
14 | 3abda73467037 |
15 | 19b2b56ae8b6b |
hex | c2abd7203c59 |
214043304410201 has 12 divisors (see below), whose sum is σ = 249228793157760. Its totient is φ = 183289110346440.
The previous prime is 214043304410197. The next prime is 214043304410227. The reversal of 214043304410201 is 102014403340412.
It is not a de Polignac number, because 214043304410201 - 22 = 214043304410197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214043304410231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2102081285 + ... + 2102183106.
It is an arithmetic number, because the mean of its divisors is an integer number (20769066096480).
Almost surely, 2214043304410201 is an apocalyptic number.
It is an amenable number.
214043304410201 is a deficient number, since it is larger than the sum of its proper divisors (35185488747559).
214043304410201 is a wasteful number, since it uses less digits than its factorization.
214043304410201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4204265444 (or 4204265437 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 214043304410201 its reverse (102014403340412), we get a palindrome (316057707750613).
The spelling of 214043304410201 in words is "two hundred fourteen trillion, forty-three billion, three hundred four million, four hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •