Base | Representation |
---|---|
bin | 10110110000110010111001… |
… | …000010100110000010001001 |
3 | 111010110102221010012100012010 |
4 | 112300302321002212002021 |
5 | 101110201143230401301 |
6 | 552525554134210133 |
7 | 30041503064322534 |
oct | 2660627102460211 |
9 | 433412833170163 |
10 | 100110202200201 |
11 | 29997553302296 |
12 | b28a0401b3949 |
13 | 43b24754ba72b |
14 | 1aa1506bcba1b |
15 | b891695085d6 |
hex | 5b0cb90a6089 |
100110202200201 has 32 divisors (see below), whose sum is σ = 139054299955200. Its totient is φ = 64025251778880.
The previous prime is 100110202200193. The next prime is 100110202200227. The reversal of 100110202200201 is 102002202011001.
It is not a de Polignac number, because 100110202200201 - 23 = 100110202200193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100110202200601) 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 31 ways as a sum of consecutive naturals, for example, 35132871 + ... + 37875308.
It is an arithmetic number, because the mean of its divisors is an integer number (4345446873600).
Almost surely, 2100110202200201 is an apocalyptic number.
It is an amenable number.
100110202200201 is a deficient number, since it is larger than the sum of its proper divisors (38944097754999).
100110202200201 is a wasteful number, since it uses less digits than its factorization.
100110202200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73008429.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100110202200201 its reverse (102002202011001), we get a palindrome (202112404211202).
It can be divided in two parts, 10011020 and 2200201, that added together give a palindrome (12211221).
The spelling of 100110202200201 in words is "one hundred trillion, one hundred ten billion, two hundred two million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •