Base | Representation |
---|---|
bin | 10011000011100001… |
… | …10001100000000101 |
3 | 222101221202102222212 |
4 | 21201300301200011 |
5 | 131422402011323 |
6 | 4411042433205 |
7 | 511340334131 |
oct | 114160614005 |
9 | 28357672885 |
10 | 10230110213 |
11 | 437a6a3244 |
12 | 1b96062805 |
13 | c7058796b |
14 | 6d09423c1 |
15 | 3ed1b3b78 |
hex | 261c31805 |
10230110213 has 4 divisors (see below), whose sum is σ = 10831881420. Its totient is φ = 9628339008.
The previous prime is 10230110183. The next prime is 10230110221. The reversal of 10230110213 is 31201103201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31201103201 = 39301 ⋅793901.
It can be written as a sum of positive squares in 2 ways, for example, as 7385167969 + 2844942244 = 85937^2 + 53338^2 .
It is a cyclic number.
It is not a de Polignac number, because 10230110213 - 226 = 10163001349 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230110243) 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, 300885578 + ... + 300885611.
It is an arithmetic number, because the mean of its divisors is an integer number (2707970355).
Almost surely, 210230110213 is an apocalyptic number.
It is an amenable number.
10230110213 is a deficient number, since it is larger than the sum of its proper divisors (601771207).
10230110213 is an equidigital number, since it uses as much as digits as its factorization.
10230110213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 601771206.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10230110213 its reverse (31201103201), we get a palindrome (41431213414).
The spelling of 10230110213 in words is "ten billion, two hundred thirty million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •