Base | Representation |
---|---|
bin | 110000011101010100100101… |
… | …100111100110100010110110 |
3 | 1000221121012002002120212022102 |
4 | 300131110211213212202312 |
5 | 210413234211023131202 |
6 | 2033134310150102102 |
7 | 62614333044402035 |
oct | 6035244547464266 |
9 | 1027535062525272 |
10 | 213121203333302 |
11 | 619a82162502a0 |
12 | 1baa039794a932 |
13 | 91bc3215220a4 |
14 | 3a8b19ab0c71c |
15 | 1998b89174d02 |
hex | c1d5259e68b6 |
213121203333302 has 32 divisors (see below), whose sum is σ = 349524134104320. Its totient is φ = 96656607164320.
The previous prime is 213121203333301. The next prime is 213121203333377. The reversal of 213121203333302 is 203333302121312.
213121203333302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213121203333301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42078248 + ... + 46870260.
It is an arithmetic number, because the mean of its divisors is an integer number (10922629190760).
Almost surely, 2213121203333302 is an apocalyptic number.
213121203333302 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
213121203333302 is a deficient number, since it is larger than the sum of its proper divisors (136402930771018).
213121203333302 is a wasteful number, since it uses less digits than its factorization.
213121203333302 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4796548.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 213121203333302 its reverse (203333302121312), we get a palindrome (416454505454614).
The spelling of 213121203333302 in words is "two hundred thirteen trillion, one hundred twenty-one billion, two hundred three million, three hundred thirty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •