Base | Representation |
---|---|
bin | 110000111100000001110100… |
… | …111000111010010001010101 |
3 | 1001020001220202200210121112221 |
4 | 300330001310320322101111 |
5 | 211202322312211303244 |
6 | 2041431531154142341 |
7 | 63222644541052405 |
oct | 6074016470722125 |
9 | 1036056680717487 |
10 | 215231362212949 |
11 | 62641120998885 |
12 | 201813438819b1 |
13 | 93132cc170b84 |
14 | 3b213798dc805 |
15 | 19d39dd180784 |
hex | c3c074e3a455 |
215231362212949 has 2 divisors, whose sum is σ = 215231362212950. Its totient is φ = 215231362212948.
The previous prime is 215231362212847. The next prime is 215231362213103. The reversal of 215231362212949 is 949212263132512.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145253837536900 + 69977524676049 = 12052130^2 + 8365257^2 .
It is a cyclic number.
It is not a de Polignac number, because 215231362212949 - 27 = 215231362212821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 215231362212896 and 215231362212905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215231362218949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107615681106474 + 107615681106475.
It is an arithmetic number, because the mean of its divisors is an integer number (107615681106475).
Almost surely, 2215231362212949 is an apocalyptic number.
It is an amenable number.
215231362212949 is a deficient number, since it is larger than the sum of its proper divisors (1).
215231362212949 is an equidigital number, since it uses as much as digits as its factorization.
215231362212949 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2799360, while the sum is 52.
The spelling of 215231362212949 in words is "two hundred fifteen trillion, two hundred thirty-one billion, three hundred sixty-two million, two hundred twelve thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •