Base | Representation |
---|---|
bin | 110000011011111010001010… |
… | …100110001011001010100100 |
3 | 1000221020220110201101120111111 |
4 | 300123322022212023022210 |
5 | 210410141340440210040 |
6 | 2033021532051514404 |
7 | 62604325053101110 |
oct | 6033721246131244 |
9 | 1027226421346444 |
10 | 213024113210020 |
11 | 6197002341a692 |
12 | 1ba856005b8a04 |
13 | 91b311a830ab8 |
14 | 3a865ca314740 |
15 | 19963a562adea |
hex | c1be8a98b2a4 |
213024113210020 has 48 divisors (see below), whose sum is σ = 527750061124608. Its totient is φ = 70680811754880.
The previous prime is 213024113210011. The next prime is 213024113210039. The reversal of 213024113210020 is 20012311420312.
It is a junction number, because it is equal to n+sod(n) for n = 213024113209973 and 213024113210000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24541944187 + ... + 24541952866.
It is an arithmetic number, because the mean of its divisors is an integer number (10994792940096).
Almost surely, 2213024113210020 is an apocalyptic number.
213024113210020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
213024113210020 is an abundant number, since it is smaller than the sum of its proper divisors (314725947914588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213024113210020 is a wasteful number, since it uses less digits than its factorization.
213024113210020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49083897100 (or 49083897098 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 213024113210020 its reverse (20012311420312), we get a palindrome (233036424630332).
The spelling of 213024113210020 in words is "two hundred thirteen trillion, twenty-four billion, one hundred thirteen million, two hundred ten thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •