Base | Representation |
---|---|
bin | 1100010111010010111… |
… | …1011111100001011011 |
3 | 202022021100122211200200 |
4 | 3011310233133201123 |
5 | 11440004433120233 |
6 | 241325234233243 |
7 | 21226524150612 |
oct | 3056457374133 |
9 | 668240584620 |
10 | 212412004443 |
11 | 820a1047911 |
12 | 35200425823 |
13 | 170519392c2 |
14 | a3d070a879 |
15 | 57d2e7a313 |
hex | 3174bdf85b |
212412004443 has 12 divisors (see below), whose sum is σ = 320157224400. Its totient is φ = 135451133136.
The previous prime is 212412004423. The next prime is 212412004459. The reversal of 212412004443 is 344400214212.
212412004443 is a `hidden beast` number, since 2 + 12 + 4 + 1 + 200 + 4 + 443 = 666.
It is not a de Polignac number, because 212412004443 - 28 = 212412004187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212412004423) 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, 513072268 + ... + 513072681.
It is an arithmetic number, because the mean of its divisors is an integer number (26679768700).
Almost surely, 2212412004443 is an apocalyptic number.
212412004443 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
212412004443 is a deficient number, since it is larger than the sum of its proper divisors (107745219957).
212412004443 is a wasteful number, since it uses less digits than its factorization.
212412004443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026144978 (or 1026144975 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 212412004443 its reverse (344400214212), we get a palindrome (556812218655).
The spelling of 212412004443 in words is "two hundred twelve billion, four hundred twelve million, four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •