Base | Representation |
---|---|
bin | 101110101101110101… |
… | …1010100011001011001 |
3 | 100120221122011102011022 |
4 | 1131123223110121121 |
5 | 3120430004031301 |
6 | 114030515412225 |
7 | 10151036510462 |
oct | 1353353243131 |
9 | 316848142138 |
10 | 100322330201 |
11 | 396013815a5 |
12 | 175398b4075 |
13 | 95ca528482 |
14 | 4bd9ba7d69 |
15 | 29226a9d1b |
hex | 175bad4659 |
100322330201 has 8 divisors (see below), whose sum is σ = 100748007360. Its totient is φ = 99896988592.
The previous prime is 100322330167. The next prime is 100322330233. The reversal of 100322330201 is 102033223001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100322330201 is a prime.
It is a super-3 number, since 3×1003223302013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100322330201.
It is not an unprimeable number, because it can be changed into a prime (100322330701) 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, 524666 + ... + 689868.
It is an arithmetic number, because the mean of its divisors is an integer number (12593500920).
Almost surely, 2100322330201 is an apocalyptic number.
It is an amenable number.
100322330201 is a deficient number, since it is larger than the sum of its proper divisors (425677159).
100322330201 is a wasteful number, since it uses less digits than its factorization.
100322330201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167775.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 100322330201 its reverse (102033223001), we get a palindrome (202355553202).
The spelling of 100322330201 in words is "one hundred billion, three hundred twenty-two million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •