Base | Representation |
---|---|
bin | 101101110101000110101110… |
… | …101100111010111011110101 |
3 | 222102200002100002121220100011 |
4 | 231311012232230322323311 |
5 | 202404340323004322201 |
6 | 1552404015152420221 |
7 | 60312222443025610 |
oct | 5565065654727365 |
9 | 872602302556304 |
10 | 201561451245301 |
11 | 59250805593884 |
12 | 1a733b62247671 |
13 | 88612179b42a4 |
14 | 37ab8aa795177 |
15 | 18481212a5151 |
hex | b751aeb3aef5 |
201561451245301 has 8 divisors (see below), whose sum is σ = 230356428146624. Its totient is φ = 172766595310560.
The previous prime is 201561451245263. The next prime is 201561451245307. The reversal of 201561451245301 is 103542154165102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201561451245301 - 231 = 201559303761653 is a prime.
It is a super-2 number, since 2×2015614512453012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201561451245307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26642535 + ... + 33360868.
It is an arithmetic number, because the mean of its divisors is an integer number (28794553518328).
Almost surely, 2201561451245301 is an apocalyptic number.
It is an amenable number.
201561451245301 is a deficient number, since it is larger than the sum of its proper divisors (28794976901323).
201561451245301 is an equidigital number, since it uses as much as digits as its factorization.
201561451245301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60483291.
The product of its (nonzero) digits is 144000, while the sum is 40.
The spelling of 201561451245301 in words is "two hundred one trillion, five hundred sixty-one billion, four hundred fifty-one million, two hundred forty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •