Base | Representation |
---|---|
bin | 1011101101111101010… |
… | …0101111000010100101 |
3 | 201020122000011022210000 |
4 | 2323133110233002211 |
5 | 11244243201002331 |
6 | 232252152251513 |
7 | 20354531252052 |
oct | 2733724570245 |
9 | 636560138700 |
10 | 201315250341 |
11 | 78417235257 |
12 | 330240a0b99 |
13 | 15ca396670a |
14 | 9a5aa52029 |
15 | 5383b780e6 |
hex | 2edf52f0a5 |
201315250341 has 10 divisors (see below), whose sum is σ = 300730188902. Its totient is φ = 134210166840.
The previous prime is 201315250313. The next prime is 201315250351. The reversal of 201315250341 is 143052513102.
201315250341 is a `hidden beast` number, since 2 + 0 + 1 + 3 + 152 + 503 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 150815722500 + 50499527841 = 388350^2 + 224721^2 .
It is a de Polignac number, because none of the positive numbers 2k-201315250341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201315250351) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1242686650 + ... + 1242686811.
Almost surely, 2201315250341 is an apocalyptic number.
It is an amenable number.
201315250341 is a deficient number, since it is larger than the sum of its proper divisors (99414938561).
201315250341 is an equidigital number, since it uses as much as digits as its factorization.
201315250341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2485373473 (or 2485373464 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 201315250341 its reverse (143052513102), we get a palindrome (344367763443).
The spelling of 201315250341 in words is "two hundred one billion, three hundred fifteen million, two hundred fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •