Base | Representation |
---|---|
bin | 1011101110101110110… |
… | …1011011011010100001 |
3 | 201021011111011122112001 |
4 | 2323223231123122201 |
5 | 11300204400101040 |
6 | 232324534204001 |
7 | 20362633443304 |
oct | 2735355333241 |
9 | 637144148461 |
10 | 201523050145 |
11 | 7851356532a |
12 | 330817b3601 |
13 | 16007a21c91 |
14 | 9a7a4a4b3b |
15 | 539702359a |
hex | 2eebb5b6a1 |
201523050145 has 8 divisors (see below), whose sum is σ = 247725896040. Its totient is φ = 157286282880.
The previous prime is 201523050133. The next prime is 201523050163. The reversal of 201523050145 is 541050325102.
It can be written as a sum of positive squares in 4 ways, for example, as 112381201 + 201410668944 = 10601^2 + 448788^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-201523050145 is a prime.
It is a super-2 number, since 2×2015230501452 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 491519430 + ... + 491519839.
It is an arithmetic number, because the mean of its divisors is an integer number (30965737005).
Almost surely, 2201523050145 is an apocalyptic number.
It is an amenable number.
201523050145 is a deficient number, since it is larger than the sum of its proper divisors (46202845895).
201523050145 is an equidigital number, since it uses as much as digits as its factorization.
201523050145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 983039315.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 201523050145 its reverse (541050325102), we get a palindrome (742573375247).
The spelling of 201523050145 in words is "two hundred one billion, five hundred twenty-three million, fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •