Base | Representation |
---|---|
bin | 101101110001100001001101… |
… | …000111111000110000110100 |
3 | 222101210112012120000211122220 |
4 | 231301201031013320300310 |
5 | 202341321110224330002 |
6 | 1552054500144522340 |
7 | 60255346252426662 |
oct | 5561411507706064 |
9 | 871715176024586 |
10 | 201315001011252 |
11 | 591662378882a7 |
12 | 1a6b42426203b0 |
13 | 8843c0019772b |
14 | 379d9ab5b7c32 |
15 | 18419e9e287bc |
hex | b7184d1f8c34 |
201315001011252 has 48 divisors (see below), whose sum is σ = 501557292741120. Its totient is φ = 62694661585248.
The previous prime is 201315001011251. The next prime is 201315001011307. The reversal of 201315001011252 is 252110100513102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201315001011251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8481408802 + ... + 8481432537.
It is an arithmetic number, because the mean of its divisors is an integer number (10449110265440).
Almost surely, 2201315001011252 is an apocalyptic number.
It is an amenable number.
201315001011252 is an abundant number, since it is smaller than the sum of its proper divisors (300242291729868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201315001011252 is a wasteful number, since it uses less digits than its factorization.
201315001011252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16962841412 (or 16962841410 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 201315001011252 its reverse (252110100513102), we get a palindrome (453425101524354).
The spelling of 201315001011252 in words is "two hundred one trillion, three hundred fifteen billion, one million, eleven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •