Base | Representation |
---|---|
bin | 101111110011000000001000… |
… | …100100011101111100111101 |
3 | 1000120022011120000102200110111 |
4 | 233303000020210131330331 |
5 | 210023112232404104041 |
6 | 2023030310223110021 |
7 | 62164250451366505 |
oct | 5763001044357475 |
9 | 1016264500380414 |
10 | 210213023113021 |
11 | 60a8692a33a095 |
12 | 1b6b0838142311 |
13 | 903b00683b5b6 |
14 | 39ca516698a05 |
15 | 19481ca921981 |
hex | bf300891df3d |
210213023113021 has 16 divisors (see below), whose sum is σ = 215890016428800. Its totient is φ = 204586265535808.
The previous prime is 210213023113007. The next prime is 210213023113081. The reversal of 210213023113021 is 120311320312012.
It is a cyclic number.
It is not a de Polignac number, because 210213023113021 - 239 = 209663267299133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210213023112983 and 210213023113001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210213023113081) 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, 393705591 + ... + 394239163.
It is an arithmetic number, because the mean of its divisors is an integer number (13493126026800).
Almost surely, 2210213023113021 is an apocalyptic number.
It is an amenable number.
210213023113021 is a deficient number, since it is larger than the sum of its proper divisors (5676993315779).
210213023113021 is a wasteful number, since it uses less digits than its factorization.
210213023113021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580628.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 210213023113021 its reverse (120311320312012), we get a palindrome (330524343425033).
The spelling of 210213023113021 in words is "two hundred ten trillion, two hundred thirteen billion, twenty-three million, one hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •