Base | Representation |
---|---|
bin | 110000011011101101000111… |
… | …100001100101110100101011 |
3 | 1000221012120022022202211212011 |
4 | 300123231013201211310223 |
5 | 210404424142334030011 |
6 | 2033011253533100351 |
7 | 62603320632415255 |
oct | 6033550741456453 |
9 | 1027176268684764 |
10 | 213010103033131 |
11 | 619650940003a8 |
12 | 1ba829506276b7 |
13 | 91b19c709a9c1 |
14 | 3a85a5b74ccd5 |
15 | 1995d35687621 |
hex | c1bb47865d2b |
213010103033131 has 4 divisors (see below), whose sum is σ = 213015481165072. Its totient is φ = 213004724901192.
The previous prime is 213010103033089. The next prime is 213010103033153. The reversal of 213010103033131 is 131330301010312.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 213010103033131 - 27 = 213010103033003 is a prime.
It is a super-2 number, since 2×2130101030331312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213010103033531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2689006560 + ... + 2689085773.
It is an arithmetic number, because the mean of its divisors is an integer number (53253870291268).
Almost surely, 2213010103033131 is an apocalyptic number.
213010103033131 is a deficient number, since it is larger than the sum of its proper divisors (5378131941).
213010103033131 is an equidigital number, since it uses as much as digits as its factorization.
213010103033131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5378131940.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 213010103033131 its reverse (131330301010312), we get a palindrome (344340404043443).
The spelling of 213010103033131 in words is "two hundred thirteen trillion, ten billion, one hundred three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •