Base | Representation |
---|---|
bin | 1011101110110100011… |
… | …1101100101010001100 |
3 | 201021020010200212212111 |
4 | 2323231013230222030 |
5 | 11300231424314430 |
6 | 232331141313404 |
7 | 20363341541341 |
oct | 2735507545214 |
9 | 637203625774 |
10 | 201546713740 |
11 | 78525958119 |
12 | 33089705864 |
13 | 1600c8b8ac8 |
14 | 9a7d6a47c8 |
15 | 5399149c2a |
hex | 2eed1eca8c |
201546713740 has 24 divisors (see below), whose sum is σ = 423612075600. Its totient is φ = 80549356608.
The previous prime is 201546713737. The next prime is 201546713747. The reversal of 201546713740 is 47317645102.
201546713740 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201546713693 and 201546713702.
It is not an unprimeable number, because it can be changed into a prime (201546713747) 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, 4309215 + ... + 4355734.
It is an arithmetic number, because the mean of its divisors is an integer number (17650503150).
Almost surely, 2201546713740 is an apocalyptic number.
201546713740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201546713740 is an abundant number, since it is smaller than the sum of its proper divisors (222065361860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201546713740 is a wasteful number, since it uses less digits than its factorization.
201546713740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8666121 (or 8666119 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 40.
The spelling of 201546713740 in words is "two hundred one billion, five hundred forty-six million, seven hundred thirteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •