Base | Representation |
---|---|
bin | 110000001101001100011111… |
… | …100100100110010101000011 |
3 | 1000210200020121112002212020011 |
4 | 300031030133210212111003 |
5 | 210242110111040222243 |
6 | 2030525232221325351 |
7 | 62441301535250536 |
oct | 6015143744462503 |
9 | 1023606545085204 |
10 | 212013000320323 |
11 | 61610232571234 |
12 | 1b941658a06857 |
13 | 913b9811331a7 |
14 | 3a4d6ac012a1d |
15 | 1979e2847689d |
hex | c0d31f926543 |
212013000320323 has 8 divisors (see below), whose sum is σ = 224492890254192. Its totient is φ = 199534058939136.
The previous prime is 212013000320291. The next prime is 212013000320377. The reversal of 212013000320323 is 323023000310212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212013000320323 - 25 = 212013000320291 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212013000320294 and 212013000320303.
It is not an unprimeable number, because it can be changed into a prime (212013000360323) 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, 236677965 + ... + 237572062.
It is an arithmetic number, because the mean of its divisors is an integer number (28061611281774).
Almost surely, 2212013000320323 is an apocalyptic number.
212013000320323 is a deficient number, since it is larger than the sum of its proper divisors (12479889933869).
212013000320323 is a wasteful number, since it uses less digits than its factorization.
212013000320323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474276341.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 212013000320323 its reverse (323023000310212), we get a palindrome (535036000630535).
The spelling of 212013000320323 in words is "two hundred twelve trillion, thirteen billion, three hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •