Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1101100010100001111 |
3 | 201012221010120221220111 |
4 | 2323033023230110033 |
5 | 11243214334210211 |
6 | 232205240100451 |
7 | 20345032403335 |
oct | 2731713542417 |
9 | 635833527814 |
10 | 201044444431 |
11 | 78298390816 |
12 | 32b69464727 |
13 | 15c5c81ab2c |
14 | 9a32abbb55 |
15 | 5369ed4421 |
hex | 2ecf2ec50f |
201044444431 has 8 divisors (see below), whose sum is σ = 211685769200. Its totient is φ = 190409123520.
The previous prime is 201044444407. The next prime is 201044444441. The reversal of 201044444431 is 134444440102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201044444431 - 215 = 201044411663 is a prime.
It is a super-2 number, since 2×2010444444312 (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 = 201044444393 and 201044444402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201044444401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1432140 + ... + 1566241.
It is an arithmetic number, because the mean of its divisors is an integer number (26460721150).
Almost surely, 2201044444431 is an apocalyptic number.
201044444431 is a deficient number, since it is larger than the sum of its proper divisors (10641324769).
201044444431 is a wasteful number, since it uses less digits than its factorization.
201044444431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3001929.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 201044444431 its reverse (134444440102), we get a palindrome (335488884533).
The spelling of 201044444431 in words is "two hundred one billion, forty-four million, four hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •