Base | Representation |
---|---|
bin | 1100010010111100010… |
… | …0111011110111010001 |
3 | 202012020220101110110000 |
4 | 3010233010323313101 |
5 | 11430111231023213 |
6 | 241013243200213 |
7 | 21155542514220 |
oct | 3045704736721 |
9 | 665226343400 |
10 | 211243220433 |
11 | 81651322113 |
12 | 34b34b16069 |
13 | 16bc675442b |
14 | a31d3c4cb7 |
15 | 5765558c73 |
hex | 312f13bdd1 |
211243220433 has 40 divisors (see below), whose sum is σ = 362150173440. Its totient is φ = 120205270080.
The previous prime is 211243220411. The next prime is 211243220471. The reversal of 211243220433 is 334022342112.
211243220433 is a `hidden beast` number, since 2 + 1 + 1 + 2 + 4 + 3 + 220 + 433 = 666.
It is not a de Polignac number, because 211243220433 - 26 = 211243220369 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 211243220397 and 211243220406.
It is not an unprimeable number, because it can be changed into a prime (211243220033) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 643908 + ... + 914933.
It is an arithmetic number, because the mean of its divisors is an integer number (9053754336).
Almost surely, 2211243220433 is an apocalyptic number.
It is an amenable number.
211243220433 is a deficient number, since it is larger than the sum of its proper divisors (150906953007).
211243220433 is a wasteful number, since it uses less digits than its factorization.
211243220433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1559099 (or 1559090 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 211243220433 its reverse (334022342112), we get a palindrome (545265562545).
The spelling of 211243220433 in words is "two hundred eleven billion, two hundred forty-three million, two hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •