Base | Representation |
---|---|
bin | 1011101100111100001… |
… | …0110000001100010100 |
3 | 201012220222011220100012 |
4 | 2323033002300030110 |
5 | 11243213234213022 |
6 | 232205113535352 |
7 | 20345003443244 |
oct | 2731702601424 |
9 | 635828156305 |
10 | 201042101012 |
11 | 78297030105 |
12 | 32b68714558 |
13 | 15c5c1aa2ac |
14 | 9a3266bb24 |
15 | 5369bbede2 |
hex | 2ecf0b0314 |
201042101012 has 6 divisors (see below), whose sum is σ = 351823676778. Its totient is φ = 100521050504.
The previous prime is 201042101011. The next prime is 201042101023. The reversal of 201042101012 is 210101240102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 169031165956 + 32010935056 = 411134^2 + 178916^2 .
It is a super-2 number, since 2×2010421010122 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201042101011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25130262623 + ... + 25130262630.
It is an arithmetic number, because the mean of its divisors is an integer number (58637279463).
Almost surely, 2201042101012 is an apocalyptic number.
It is an amenable number.
201042101012 is a deficient number, since it is larger than the sum of its proper divisors (150781575766).
201042101012 is a wasteful number, since it uses less digits than its factorization.
201042101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50260525257 (or 50260525255 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201042101012 its reverse (210101240102), we get a palindrome (411143341114).
The spelling of 201042101012 in words is "two hundred one billion, forty-two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •