Base | Representation |
---|---|
bin | 110000000101000000010110… |
… | …101111001111111011100010 |
3 | 1000201200102221210110120202112 |
4 | 300011000112233033323202 |
5 | 210203400013104321232 |
6 | 2025414515221515322 |
7 | 62352526233336506 |
oct | 6005002657177342 |
9 | 1021612853416675 |
10 | 211450211401442 |
11 | 61413592927742 |
12 | 1b870573b72b42 |
13 | 90ca89180a9a0 |
14 | 3a3035db9c306 |
15 | 196a48a3444b2 |
hex | c05016bcfee2 |
211450211401442 has 16 divisors (see below), whose sum is σ = 342149427579960. Its totient is φ = 97427831215872.
The previous prime is 211450211401393. The next prime is 211450211401493. The reversal of 211450211401442 is 244104112054112.
It can be written as a sum of positive squares in 4 ways, for example, as 159186695520241 + 52263515881201 = 12616921^2 + 7229351^2 .
It is a super-2 number, since 2×2114502114014422 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211450211401399 and 211450211401408.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 6857236217 + ... + 6857267052.
Almost surely, 2211450211401442 is an apocalyptic number.
211450211401442 is a deficient number, since it is larger than the sum of its proper divisors (130699216178518).
211450211401442 is a wasteful number, since it uses less digits than its factorization.
211450211401442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13714503877.
The product of its (nonzero) digits is 10240, while the sum is 32.
Adding to 211450211401442 its reverse (244104112054112), we get a palindrome (455554323455554).
The spelling of 211450211401442 in words is "two hundred eleven trillion, four hundred fifty billion, two hundred eleven million, four hundred one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •