Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1101001110011000001 |
3 | 201012221010120102202100 |
4 | 2323033023221303001 |
5 | 11243214333342423 |
6 | 232205235541013 |
7 | 20345032331265 |
oct | 2731713516301 |
9 | 635833512670 |
10 | 201044434113 |
11 | 78298383a96 |
12 | 32b6945a769 |
13 | 15c5c816223 |
14 | 9a32ab80a5 |
15 | 5369ed1343 |
hex | 2ecf2e9cc1 |
201044434113 has 6 divisors (see below), whose sum is σ = 290397515954. Its totient is φ = 134029622736.
The previous prime is 201044434109. The next prime is 201044434117. The reversal of 201044434113 is 311434440102.
201044434113 is a `hidden beast` number, since 2 + 0 + 104 + 443 + 4 + 113 = 666.
It is an interprime number because it is at equal distance from previous prime (201044434109) and next prime (201044434117).
It can be written as a sum of positive squares in only one way, i.e., 200872483344 + 171950769 = 448188^2 + 13113^2 .
It is not a de Polignac number, because 201044434113 - 22 = 201044434109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201044434117) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11169135220 + ... + 11169135237.
Almost surely, 2201044434113 is an apocalyptic number.
It is an amenable number.
201044434113 is a deficient number, since it is larger than the sum of its proper divisors (89353081841).
201044434113 is a wasteful number, since it uses less digits than its factorization.
201044434113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22338270463 (or 22338270460 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 201044434113 its reverse (311434440102), we get a palindrome (512478874215).
The spelling of 201044434113 in words is "two hundred one billion, forty-four million, four hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •