Base | Representation |
---|---|
bin | 1100011011001000000… |
… | …1110010011000000001 |
3 | 202101221000102010011000 |
4 | 3012302001302120001 |
5 | 11444111143213213 |
6 | 242015244242213 |
7 | 21264150565662 |
oct | 3066201623001 |
9 | 671830363130 |
10 | 213440210433 |
11 | 8257948622a |
12 | 35448840369 |
13 | 17186970a08 |
14 | a48b0bb369 |
15 | 584337dc73 |
hex | 31b2072601 |
213440210433 has 32 divisors (see below), whose sum is σ = 317409148800. Its totient is φ = 141753872448.
The previous prime is 213440210429. The next prime is 213440210441. The reversal of 213440210433 is 334012044312.
213440210433 is a `hidden beast` number, since 2 + 1 + 3 + 440 + 210 + 4 + 3 + 3 = 666.
It is not a de Polignac number, because 213440210433 - 22 = 213440210429 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 = 213440210397 and 213440210406.
It is not an unprimeable number, because it can be changed into a prime (213440210233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7640910 + ... + 7668792.
It is an arithmetic number, because the mean of its divisors is an integer number (9919035900).
Almost surely, 2213440210433 is an apocalyptic number.
It is an amenable number.
213440210433 is a deficient number, since it is larger than the sum of its proper divisors (103968938367).
213440210433 is a wasteful number, since it uses less digits than its factorization.
213440210433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28958 (or 28952 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 213440210433 its reverse (334012044312), we get a palindrome (547452254745).
The spelling of 213440210433 in words is "two hundred thirteen billion, four hundred forty million, two hundred ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •