Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1101011110001110111 |
3 | 201012221010120211220000 |
4 | 2323033023223301313 |
5 | 11243214334122411 |
6 | 232205240042343 |
7 | 20345032364043 |
oct | 2731713536167 |
9 | 635833524800 |
10 | 201044442231 |
11 | 7829838a0a6 |
12 | 32b694633b3 |
13 | 15c5c819b29 |
14 | 9a32abb023 |
15 | 5369ed3956 |
hex | 2ecf2ebc77 |
201044442231 has 20 divisors (see below), whose sum is σ = 301467602832. Its totient is φ = 133519995648.
The previous prime is 201044442211. The next prime is 201044442241. The reversal of 201044442231 is 132244440102.
201044442231 is a `hidden beast` number, since 201 + 0 + 4 + 4 + 4 + 422 + 31 = 666.
It is not a de Polignac number, because 201044442231 - 25 = 201044442199 is a prime.
It is a super-2 number, since 2×2010444422312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 201044442195 and 201044442204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201044442211) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4697386 + ... + 4739991.
Almost surely, 2201044442231 is an apocalyptic number.
201044442231 is a deficient number, since it is larger than the sum of its proper divisors (100423160601).
201044442231 is an equidigital number, since it uses as much as digits as its factorization.
201044442231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9437652 (or 9437643 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 201044442231 its reverse (132244440102), we get a palindrome (333288882333).
The spelling of 201044442231 in words is "two hundred one billion, forty-four million, four hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •