Base | Representation |
---|---|
bin | 110000011111011001110100… |
… | …001100000110000011010000 |
3 | 1000222002212022122100222200011 |
4 | 300133121310030012003100 |
5 | 210423110143343140102 |
6 | 2033324125121204304 |
7 | 62630556026306554 |
oct | 6037316414060320 |
9 | 1028085278328604 |
10 | 213264255443152 |
11 | 61a52954456771 |
12 | 1bb0405b790694 |
13 | 91cc96b512134 |
14 | 3a9408b829864 |
15 | 199c75ccd02d7 |
hex | c1f6743060d0 |
213264255443152 has 20 divisors (see below), whose sum is σ = 434946836759680. Its totient is φ = 101019910472928.
The previous prime is 213264255443137. The next prime is 213264255443167. The reversal of 213264255443152 is 251344552462312.
It is an interprime number because it is at equal distance from previous prime (213264255443137) and next prime (213264255443167).
It is a junction number, because it is equal to n+sod(n) for n = 213264255443096 and 213264255443105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350763577728 + ... + 350763578335.
It is an arithmetic number, because the mean of its divisors is an integer number (21747341837984).
Almost surely, 2213264255443152 is an apocalyptic number.
It is an amenable number.
213264255443152 is an abundant number, since it is smaller than the sum of its proper divisors (221682581316528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213264255443152 is a wasteful number, since it uses less digits than its factorization.
213264255443152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 701527156090 (or 701527156084 counting only the distinct ones).
The product of its digits is 6912000, while the sum is 49.
The spelling of 213264255443152 in words is "two hundred thirteen trillion, two hundred sixty-four billion, two hundred fifty-five million, four hundred forty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •