Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1101001100011100010 |
3 | 201012221010120101101122 |
4 | 2323033023221203202 |
5 | 11243214333324442 |
6 | 232205235532242 |
7 | 20345032325351 |
oct | 2731713514342 |
9 | 635833511348 |
10 | 201044433122 |
11 | 78298383275 |
12 | 32b6945a082 |
13 | 15c5c815940 |
14 | 9a32ab7998 |
15 | 5369ed0dd2 |
hex | 2ecf2e98e2 |
201044433122 has 8 divisors (see below), whose sum is σ = 324764084316. Its totient is φ = 92789738352.
The previous prime is 201044433097. The next prime is 201044433151. The reversal of 201044433122 is 221334440102.
It can be written as a sum of positive squares in 2 ways, for example, as 200147969641 + 896463481 = 447379^2 + 29941^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2010444331223 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 7732478197 = 201044433122 / (2 + 0 + 1 + 0 + 4 + 4 + 4 + 3 + 3 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 201044433091 and 201044433100.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3866239073 + ... + 3866239124.
Almost surely, 2201044433122 is an apocalyptic number.
201044433122 is a deficient number, since it is larger than the sum of its proper divisors (123719651194).
201044433122 is a wasteful number, since it uses less digits than its factorization.
201044433122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7732478212.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 201044433122 its reverse (221334440102), we get a palindrome (422378873224).
The spelling of 201044433122 in words is "two hundred one billion, forty-four million, four hundred thirty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •