Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1100110101011010011 |
3 | 201012221010112210012221 |
4 | 2323033023212223103 |
5 | 11243214332440311 |
6 | 232205235401511 |
7 | 20345032246105 |
oct | 2731713465323 |
9 | 635833483187 |
10 | 201044421331 |
11 | 78298375426 |
12 | 32b69453297 |
13 | 15c5c810470 |
14 | 9a32ab3575 |
15 | 5369ecc671 |
hex | 2ecf2e6ad3 |
201044421331 has 16 divisors (see below), whose sum is σ = 226288016640. Its totient is φ = 177223860000.
The previous prime is 201044421307. The next prime is 201044421343. The reversal of 201044421331 is 133124440102.
It is a cyclic number.
It is not a de Polignac number, because 201044421331 - 25 = 201044421299 is a prime.
It is a super-2 number, since 2×2010444213312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201044421296 and 201044421305.
It is not an unprimeable number, because it can be changed into a prime (201044421301) 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 15 ways as a sum of consecutive naturals, for example, 358045 + ... + 728206.
It is an arithmetic number, because the mean of its divisors is an integer number (14143001040).
Almost surely, 2201044421331 is an apocalyptic number.
201044421331 is a deficient number, since it is larger than the sum of its proper divisors (25243595309).
201044421331 is a wasteful number, since it uses less digits than its factorization.
201044421331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086906.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 201044421331 its reverse (133124440102), we get a palindrome (334168861433).
The spelling of 201044421331 in words is "two hundred one billion, forty-four million, four hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •