Base | Representation |
---|---|
bin | 101110100101010001… |
… | …1011011101011011001 |
3 | 100120012121121002002022 |
4 | 1131022203123223121 |
5 | 3114332433101301 |
6 | 113542214144225 |
7 | 10140650616452 |
oct | 1351243335331 |
9 | 316177532068 |
10 | 100035050201 |
11 | 394741a5909 |
12 | 17479652075 |
13 | 9582b622c8 |
14 | 4bad986129 |
15 | 290735ed1b |
hex | 174a8dbad9 |
100035050201 has 8 divisors (see below), whose sum is σ = 100599459840. Its totient is φ = 99471212848.
The previous prime is 100035050153. The next prime is 100035050209. The reversal of 100035050201 is 102050530001.
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-100035050201 is a prime.
It is a super-2 number, since 2×1000350502012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100035050201.
It is not an unprimeable number, because it can be changed into a prime (100035050209) 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, 209960 + ... + 494118.
It is an arithmetic number, because the mean of its divisors is an integer number (12574932480).
Almost surely, 2100035050201 is an apocalyptic number.
It is an amenable number.
100035050201 is a deficient number, since it is larger than the sum of its proper divisors (564409639).
100035050201 is a wasteful number, since it uses less digits than its factorization.
100035050201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286143.
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 100035050201 its reverse (102050530001), we get a palindrome (202085580202).
The spelling of 100035050201 in words is "one hundred billion, thirty-five million, fifty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •