Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0001110110100100100 |
3 | 201012211210201101202022 |
4 | 2323031030032310210 |
5 | 11243132311000312 |
6 | 232202044002312 |
7 | 20344145401136 |
oct | 2731514166444 |
9 | 635753641668 |
10 | 201011031332 |
11 | 78280539a91 |
12 | 32b5a230398 |
13 | 15c5591c477 |
14 | 9a2c4a1056 |
15 | 53670d4172 |
hex | 2ecd30ed24 |
201011031332 has 6 divisors (see below), whose sum is σ = 351769304838. Its totient is φ = 100505515664.
The previous prime is 201011031329. The next prime is 201011031367. The reversal of 201011031332 is 233130110102.
201011031332 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., 160148834596 + 40862196736 = 400186^2 + 202144^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 201011031332.
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, 25126378913 + ... + 25126378920.
It is an arithmetic number, because the mean of its divisors is an integer number (58628217473).
Almost surely, 2201011031332 is an apocalyptic number.
It is an amenable number.
201011031332 is a deficient number, since it is larger than the sum of its proper divisors (150758273506).
201011031332 is a wasteful number, since it uses less digits than its factorization.
201011031332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50252757837 (or 50252757835 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201011031332 its reverse (233130110102), we get a palindrome (434141141434).
The spelling of 201011031332 in words is "two hundred one billion, eleven million, thirty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •