Base | Representation |
---|---|
bin | 1100010000000010110… |
… | …1011111100110001001 |
3 | 202010020200122012022211 |
4 | 3010000231133212021 |
5 | 11422013110322101 |
6 | 240404134145121 |
7 | 21130345505644 |
oct | 3040055374611 |
9 | 663220565284 |
10 | 210465323401 |
11 | 81292208603 |
12 | 349584b21a1 |
13 | 16b0153cc28 |
14 | a287d70a5b |
15 | 571c0eac51 |
hex | 3100b5f989 |
210465323401 has 8 divisors (see below), whose sum is σ = 211945854600. Its totient is φ = 208985699328.
The previous prime is 210465323381. The next prime is 210465323407. The reversal of 210465323401 is 104323564012.
It can be written as a sum of positive squares in 4 ways, for example, as 135903559801 + 74561763600 = 368651^2 + 273060^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 210465323401 - 221 = 210463226249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210465323407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 242275 + ... + 692551.
It is an arithmetic number, because the mean of its divisors is an integer number (26493231825).
Almost surely, 2210465323401 is an apocalyptic number.
It is an amenable number.
210465323401 is a deficient number, since it is larger than the sum of its proper divisors (1480531199).
210465323401 is a wasteful number, since it uses less digits than its factorization.
210465323401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453563.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 210465323401 its reverse (104323564012), we get a palindrome (314788887413).
The spelling of 210465323401 in words is "two hundred ten billion, four hundred sixty-five million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •