Base | Representation |
---|---|
bin | 10011000001010001… |
… | …01001100011110001 |
3 | 222100122011212121022 |
4 | 21200220221203301 |
5 | 131403032001223 |
6 | 4405125305225 |
7 | 511020540023 |
oct | 114050514361 |
9 | 28318155538 |
10 | 10211203313 |
11 | 436aa5a203 |
12 | 1b8b865215 |
13 | c69697c4c |
14 | 6cc220013 |
15 | 3eb6cbac8 |
hex | 260a298f1 |
10211203313 has 4 divisors (see below), whose sum is σ = 10278827328. Its totient is φ = 10143579300.
The previous prime is 10211203283. The next prime is 10211203333. The reversal of 10211203313 is 31330211201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31330211201 = 137 ⋅228687673.
It is a cyclic number.
It is not a de Polignac number, because 10211203313 - 226 = 10144094449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211203291 and 10211203300.
It is not an unprimeable number, because it can be changed into a prime (10211203333) 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, 33811781 + ... + 33812082.
It is an arithmetic number, because the mean of its divisors is an integer number (2569706832).
Almost surely, 210211203313 is an apocalyptic number.
It is an amenable number.
10211203313 is a deficient number, since it is larger than the sum of its proper divisors (67624015).
10211203313 is an equidigital number, since it uses as much as digits as its factorization.
10211203313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67624014.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10211203313 its reverse (31330211201), we get a palindrome (41541414514).
The spelling of 10211203313 in words is "ten billion, two hundred eleven million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •