Base | Representation |
---|---|
bin | 10011001101010011… |
… | …11011011111100101 |
3 | 222121200020011001022 |
4 | 21212221323133211 |
5 | 132104410432323 |
6 | 4423134140525 |
7 | 513355162325 |
oct | 114651733745 |
9 | 28550204038 |
10 | 10312202213 |
11 | 4411a73175 |
12 | 1bb9651745 |
13 | c8459b301 |
14 | 6db7d1285 |
15 | 4054cc4c8 |
hex | 266a7b7e5 |
10312202213 has 8 divisors (see below), whose sum is σ = 10391143320. Its totient is φ = 10233314560.
The previous prime is 10312202189. The next prime is 10312202293. The reversal of 10312202213 is 31220221301.
It can be written as a sum of positive squares in 4 ways, for example, as 1275418369 + 9036783844 = 35713^2 + 95062^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10312202213 - 26 = 10312202149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10312202191 and 10312202200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10312202293) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 429593 + ... + 452961.
It is an arithmetic number, because the mean of its divisors is an integer number (1298892915).
Almost surely, 210312202213 is an apocalyptic number.
It is an amenable number.
10312202213 is a deficient number, since it is larger than the sum of its proper divisors (78941107).
10312202213 is a wasteful number, since it uses less digits than its factorization.
10312202213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26727.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10312202213 its reverse (31220221301), we get a palindrome (41532423514).
The spelling of 10312202213 in words is "ten billion, three hundred twelve million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •