Base | Representation |
---|---|
bin | 1011101110110000111… |
… | …1101000010000011001 |
3 | 201021012010001010212110 |
4 | 2323230033220100121 |
5 | 11300214144000031 |
6 | 232325454302533 |
7 | 20363102603625 |
oct | 2735417502031 |
9 | 637163033773 |
10 | 201532015641 |
11 | 78518629230 |
12 | 330847b7a49 |
13 | 160098409c8 |
14 | 9a7b75a185 |
15 | 5397be4c46 |
hex | 2eec3e8419 |
201532015641 has 8 divisors (see below), whose sum is σ = 293137477344. Its totient is φ = 122140615520.
The previous prime is 201532015637. The next prime is 201532015681. The reversal of 201532015641 is 146510235102.
201532015641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201532015641 - 22 = 201532015637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201532015599 and 201532015608.
It is not an unprimeable number, because it can be changed into a prime (201532015681) 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 7 ways as a sum of consecutive naturals, for example, 3053515356 + ... + 3053515421.
It is an arithmetic number, because the mean of its divisors is an integer number (36642184668).
Almost surely, 2201532015641 is an apocalyptic number.
It is an amenable number.
201532015641 is a deficient number, since it is larger than the sum of its proper divisors (91605461703).
201532015641 is a wasteful number, since it uses less digits than its factorization.
201532015641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6107030791.
The product of its (nonzero) digits is 7200, while the sum is 30.
The spelling of 201532015641 in words is "two hundred one billion, five hundred thirty-two million, fifteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •