Base | Representation |
---|---|
bin | 1100011010001111001… |
… | …0000010111100111001 |
3 | 202101022100200021120220 |
4 | 3012203302002330321 |
5 | 11443114001444001 |
6 | 241535425410253 |
7 | 21255216216213 |
oct | 3064362027471 |
9 | 671270607526 |
10 | 213201203001 |
11 | 82466580426 |
12 | 353a0799989 |
13 | 171492a98b7 |
14 | a4674635b3 |
15 | 582c3bbc36 |
hex | 31a3c82f39 |
213201203001 has 16 divisors (see below), whose sum is σ = 285619165440. Its totient is φ = 141459984000.
The previous prime is 213201202999. The next prime is 213201203041. The reversal of 213201203001 is 100302102312.
213201203001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213201203001 - 21 = 213201202999 is a prime.
It is a super-2 number, since 2×2132012030012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (213201203041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 498645 + ... + 821613.
It is an arithmetic number, because the mean of its divisors is an integer number (17851197840).
Almost surely, 2213201203001 is an apocalyptic number.
It is an amenable number.
213201203001 is a deficient number, since it is larger than the sum of its proper divisors (72417962439).
213201203001 is a wasteful number, since it uses less digits than its factorization.
213201203001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324016.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 213201203001 its reverse (100302102312), we get a palindrome (313503305313).
The spelling of 213201203001 in words is "two hundred thirteen billion, two hundred one million, two hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •