Base | Representation |
---|---|
bin | 10111111111100… |
… | …11001011010101 |
3 | 112000201210010011 |
4 | 23333303023111 |
5 | 403011232234 |
6 | 31550000221 |
7 | 4662541603 |
oct | 1377631325 |
9 | 460653104 |
10 | 201274069 |
11 | a3683207 |
12 | 574a6071 |
13 | 329121a9 |
14 | 1ca34873 |
15 | 12a0bb64 |
hex | bff32d5 |
201274069 has 8 divisors (see below), whose sum is σ = 205769088. Its totient is φ = 196788000.
The previous prime is 201274039. The next prime is 201274093. The reversal of 201274069 is 960472102.
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 201274069 - 211 = 201272021 is a prime.
It is a super-2 number, since 2×2012740692 = 81022501703633522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201274069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201274039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65569 + ... + 68569.
It is an arithmetic number, because the mean of its divisors is an integer number (25721136).
Almost surely, 2201274069 is an apocalyptic number.
It is an amenable number.
201274069 is a deficient number, since it is larger than the sum of its proper divisors (4495019).
201274069 is a wasteful number, since it uses less digits than its factorization.
201274069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4475.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 201274069 is about 14187.1092545310. The cubic root of 201274069 is about 586.0427201555.
The spelling of 201274069 in words is "two hundred one million, two hundred seventy-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •