Base | Representation |
---|---|
bin | 101101101101000110000110… |
… | …100111110110000110001000 |
3 | 222100201110120210210112010202 |
4 | 231231012012213312012020 |
5 | 202321331033342342412 |
6 | 1551303104505231332 |
7 | 60224365352162456 |
oct | 5555060647660610 |
9 | 870643523715122 |
10 | 201011023012232 |
11 | 59059329164504 |
12 | 1a665348a92548 |
13 | 882134817b564 |
14 | 378cdb200b9d6 |
15 | 1838b583dd3c2 |
hex | b6d1869f6188 |
201011023012232 has 32 divisors (see below), whose sum is σ = 401650147756800. Its totient is φ = 94090266086784.
The previous prime is 201011023012231. The next prime is 201011023012321. The reversal of 201011023012232 is 232210320110102.
201011023012232 is digitally balanced in base 3, 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 (201011023012231) 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 in 7 ways as a sum of consecutive naturals, for example, 11621812757 + ... + 11621830052.
It is an arithmetic number, because the mean of its divisors is an integer number (12551567117400).
Almost surely, 2201011023012232 is an apocalyptic number.
It is an amenable number.
201011023012232 is a deficient number, since it is larger than the sum of its proper divisors (200639124744568).
201011023012232 is a wasteful number, since it uses less digits than its factorization.
201011023012232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23243642885 (or 23243642881 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 201011023012232 its reverse (232210320110102), we get a palindrome (433221343122334).
The spelling of 201011023012232 in words is "two hundred one trillion, eleven billion, twenty-three million, twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •