Base | Representation |
---|---|
bin | 1011101100110100111… |
… | …0000100011110100100 |
3 | 201012211211121212211012 |
4 | 2323031032010132210 |
5 | 11243132421411002 |
6 | 232202102201352 |
7 | 20344152446144 |
oct | 2731516043644 |
9 | 635754555735 |
10 | 201011513252 |
11 | 78280839070 |
12 | 32b5a423258 |
13 | 15c55a5a924 |
14 | 9a2c588924 |
15 | 536717bd52 |
hex | 2ecd3847a4 |
201011513252 has 24 divisors (see below), whose sum is σ = 386047166400. Its totient is φ = 90821747360.
The previous prime is 201011513231. The next prime is 201011513257. The reversal of 201011513252 is 252315110102.
201011513252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (201011513257) 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, 13670627 + ... + 13685322.
It is an arithmetic number, because the mean of its divisors is an integer number (16085298600).
Almost surely, 2201011513252 is an apocalyptic number.
201011513252 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
201011513252 is a deficient number, since it is larger than the sum of its proper divisors (185035653148).
201011513252 is a wasteful number, since it uses less digits than its factorization.
201011513252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27356131 (or 27356129 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 201011513252 its reverse (252315110102), we get a palindrome (453326623354).
The spelling of 201011513252 in words is "two hundred one billion, eleven million, five hundred thirteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •