Base | Representation |
---|---|
bin | 101101110010111110110100… |
… | …110101010111011011101101 |
3 | 222102011010200021002110220020 |
4 | 231302332310311113123231 |
5 | 202344442443430000123 |
6 | 1552213003115512353 |
7 | 60265535323300620 |
oct | 5562766465273355 |
9 | 872133607073806 |
10 | 201415525234413 |
11 | 591a4932114a86 |
12 | 1a70b817a586b9 |
13 | 8850530490999 |
14 | 37a47c60d7db7 |
15 | 18444301b37e3 |
hex | b72fb4d576ed |
201415525234413 has 8 divisors (see below), whose sum is σ = 306918895595328. Its totient is φ = 115094585848224.
The previous prime is 201415525234367. The next prime is 201415525234513. The reversal of 201415525234413 is 314432525514102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201415525234413 - 210 = 201415525233389 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201415525234513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4795607743656 + ... + 4795607743697.
It is an arithmetic number, because the mean of its divisors is an integer number (38364861949416).
Almost surely, 2201415525234413 is an apocalyptic number.
It is an amenable number.
201415525234413 is a deficient number, since it is larger than the sum of its proper divisors (105503370360915).
201415525234413 is an equidigital number, since it uses as much as digits as its factorization.
201415525234413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9591215487363.
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 201415525234413 in words is "two hundred one trillion, four hundred fifteen billion, five hundred twenty-five million, two hundred thirty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •