Base | Representation |
---|---|
bin | 110000011011100011110100… |
… | …011111010110100111001101 |
3 | 1000221011121112120221101001020 |
4 | 300123203310133112213031 |
5 | 210404243221210044041 |
6 | 2033002523154104353 |
7 | 62602515352152231 |
oct | 6033436437264715 |
9 | 1027147476841036 |
10 | 213000120003021 |
11 | 6196093092709a |
12 | 1ba80a2527b0b9 |
13 | 91b0a95a726b0 |
14 | 3a853919665c1 |
15 | 199594e02c866 |
hex | c1b8f47d69cd |
213000120003021 has 8 divisors (see below), whose sum is σ = 305846326158240. Its totient is φ = 131076996924912.
The previous prime is 213000120002987. The next prime is 213000120003103. The reversal of 213000120003021 is 120300021000312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 213000120003021 - 27 = 213000120002893 is a prime.
It is a super-2 number, since 2×2130001200030212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213000120003521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2730770769231 + ... + 2730770769308.
It is an arithmetic number, because the mean of its divisors is an integer number (38230790769780).
Almost surely, 2213000120003021 is an apocalyptic number.
It is an amenable number.
213000120003021 is a deficient number, since it is larger than the sum of its proper divisors (92846206155219).
213000120003021 is a wasteful number, since it uses less digits than its factorization.
213000120003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5461541538555.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 213000120003021 its reverse (120300021000312), we get a palindrome (333300141003333).
The spelling of 213000120003021 in words is "two hundred thirteen trillion, one hundred twenty million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •