Base | Representation |
---|---|
bin | 1011101101010011100… |
… | …1110110110011100110 |
3 | 201020011211012122020102 |
4 | 2323110321312303212 |
5 | 11243413422311402 |
6 | 232222545304102 |
7 | 20350306314641 |
oct | 2732471666346 |
9 | 636154178212 |
10 | 201140432102 |
11 | 78337591775 |
12 | 32b95635032 |
13 | 15c7668827c |
14 | 9a41746a58 |
15 | 5373645102 |
hex | 2ed4e76ce6 |
201140432102 has 4 divisors (see below), whose sum is σ = 301710648156. Its totient is φ = 100570216050.
The previous prime is 201140432099. The next prime is 201140432107. The reversal of 201140432102 is 201234041102.
201140432102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201234041102 = 2 ⋅100617020551.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201140432107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50285108024 + ... + 50285108027.
It is an arithmetic number, because the mean of its divisors is an integer number (75427662039).
Almost surely, 2201140432102 is an apocalyptic number.
201140432102 is a deficient number, since it is larger than the sum of its proper divisors (100570216054).
201140432102 is a wasteful number, since it uses less digits than its factorization.
201140432102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100570216053.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 201140432102 its reverse (201234041102), we get a palindrome (402374473204).
The spelling of 201140432102 in words is "two hundred one billion, one hundred forty million, four hundred thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •