Base | Representation |
---|---|
bin | 10111111101100… |
… | …10110010100101 |
3 | 112000020101100110 |
4 | 23332302302211 |
5 | 402424312331 |
6 | 31540203233 |
7 | 4660362660 |
oct | 1376626245 |
9 | 460211313 |
10 | 201010341 |
11 | a3513054 |
12 | 57399519 |
13 | 3284c13c |
14 | 1c9a66d7 |
15 | 129a8946 |
hex | bfb2ca5 |
201010341 has 8 divisors (see below), whose sum is σ = 306301504. Its totient is φ = 114863040.
The previous prime is 201010333. The next prime is 201010361. The reversal of 201010341 is 143010102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201010341 - 23 = 201010333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201010321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4785940 + ... + 4785981.
It is an arithmetic number, because the mean of its divisors is an integer number (38287688).
Almost surely, 2201010341 is an apocalyptic number.
201010341 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
201010341 is a deficient number, since it is larger than the sum of its proper divisors (105291163).
201010341 is an equidigital number, since it uses as much as digits as its factorization.
201010341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9571931.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 201010341 is about 14177.8115730179. The cubic root of 201010341 is about 585.7866457243.
Adding to 201010341 its reverse (143010102), we get a palindrome (344020443).
The spelling of 201010341 in words is "two hundred one million, ten thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •