Base | Representation |
---|---|
bin | 1100001110010100001… |
… | …0010010101000111111 |
3 | 202002001022221210121211 |
4 | 3003211002102220333 |
5 | 11420040224411221 |
6 | 240250110305251 |
7 | 21113010106135 |
oct | 3034502225077 |
9 | 662038853554 |
10 | 210001013311 |
11 | 81074108561 |
12 | 34848ab8227 |
13 | 16a592a292b |
14 | a242429755 |
15 | 56e14826e1 |
hex | 30e5092a3f |
210001013311 has 8 divisors (see below), whose sum is σ = 224321750784. Its totient is φ = 195898913280.
The previous prime is 210001013293. The next prime is 210001013329. The reversal of 210001013311 is 113310100012.
It is an interprime number because it is at equal distance from previous prime (210001013293) and next prime (210001013329).
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 210001013311 - 225 = 209967458879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210001013291 and 210001013300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210001083311) 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, 54657375 + ... + 54661216.
It is an arithmetic number, because the mean of its divisors is an integer number (28040218848).
Almost surely, 2210001013311 is an apocalyptic number.
210001013311 is a deficient number, since it is larger than the sum of its proper divisors (14320737473).
210001013311 is a wasteful number, since it uses less digits than its factorization.
210001013311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109318721.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 210001013311 its reverse (113310100012), we get a palindrome (323311113323).
The spelling of 210001013311 in words is "two hundred ten billion, one million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •