Base | Representation |
---|---|
bin | 110000011011111001001000… |
… | …100000001000100110100010 |
3 | 1000221020210121102211122122000 |
4 | 300123321020200020212202 |
5 | 210410132103102033102 |
6 | 2033021230040424430 |
7 | 62604255426552660 |
oct | 6033711040104642 |
9 | 1027223542748560 |
10 | 213023004330402 |
11 | 6196a60449aa52 |
12 | 1ba85351178116 |
13 | 91b2ca1b91506 |
14 | 3a86522d43c30 |
15 | 199633d0de01c |
hex | c1be488089a2 |
213023004330402 has 64 divisors (see below), whose sum is σ = 541021138771200. Its totient is φ = 60862552934400.
The previous prime is 213023004330401. The next prime is 213023004330427. The reversal of 213023004330402 is 204033400320312.
213023004330402 is a `hidden beast` number, since 2 + 13 + 0 + 2 + 300 + 43 + 304 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (213023004330401) 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, 14530152 + ... + 25242252.
It is an arithmetic number, because the mean of its divisors is an integer number (8453455293300).
Almost surely, 2213023004330402 is an apocalyptic number.
213023004330402 is an abundant number, since it is smaller than the sum of its proper divisors (327998134440798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213023004330402 is a wasteful number, since it uses less digits than its factorization.
213023004330402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10764728 (or 10764722 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 213023004330402 its reverse (204033400320312), we get a palindrome (417056404650714).
The spelling of 213023004330402 in words is "two hundred thirteen trillion, twenty-three billion, four million, three hundred thirty thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •