Base | Representation |
---|---|
bin | 1001010010011111100011… |
… | …1010010100011000101011 |
3 | 1100011101100100211122121101 |
4 | 2110213320322110120223 |
5 | 2314313331201100021 |
6 | 33415533101222231 |
7 | 2102613265441123 |
oct | 224477072243053 |
9 | 40141310748541 |
10 | 10213313300011 |
11 | 32884951085a8 |
12 | 118b4a9b61977 |
13 | 59115a722ac3 |
14 | 274481411c83 |
15 | 12aa120a3a91 |
hex | 949f8e9462b |
10213313300011 has 4 divisors (see below), whose sum is σ = 10213327155672. Its totient is φ = 10213299444352.
The previous prime is 10213313299991. The next prime is 10213313300017. The reversal of 10213313300011 is 11000331331201.
10213313300011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10213313300011 - 215 = 10213313267243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10213313300017) 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, 5756086 + ... + 7318411.
It is an arithmetic number, because the mean of its divisors is an integer number (2553331788918).
Almost surely, 210213313300011 is an apocalyptic number.
10213313300011 is a deficient number, since it is larger than the sum of its proper divisors (13855661).
10213313300011 is an equidigital number, since it uses as much as digits as its factorization.
10213313300011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13855660.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10213313300011 its reverse (11000331331201), we get a palindrome (21213644631212).
The spelling of 10213313300011 in words is "ten trillion, two hundred thirteen billion, three hundred thirteen million, three hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •