Base | Representation |
---|---|
bin | 1011101101010011110… |
… | …0100100011110001000 |
3 | 201020011212112202222222 |
4 | 2323110330210132020 |
5 | 11243414113042212 |
6 | 232223012433212 |
7 | 20350315336535 |
oct | 2732474443610 |
9 | 636155482888 |
10 | 201141143432 |
11 | 78337a28149 |
12 | 32b95918808 |
13 | 15c76876c88 |
14 | 9a4188dd8c |
15 | 5373735c72 |
hex | 2ed4f24788 |
201141143432 has 8 divisors (see below), whose sum is σ = 377139643950. Its totient is φ = 100570571712.
The previous prime is 201141143381. The next prime is 201141143479. The reversal of 201141143432 is 234341141102.
201141143432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 128675733796 + 72465409636 = 358714^2 + 269194^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×2011411434322 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 12571321457 + ... + 12571321472.
Almost surely, 2201141143432 is an apocalyptic number.
It is an amenable number.
201141143432 is a deficient number, since it is larger than the sum of its proper divisors (175998500518).
201141143432 is a wasteful number, since it uses less digits than its factorization.
201141143432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25142642935 (or 25142642931 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 201141143432 its reverse (234341141102), we get a palindrome (435482284534).
The spelling of 201141143432 in words is "two hundred one billion, one hundred forty-one million, one hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •