Base | Representation |
---|---|
bin | 111000010110110111… |
… | …000111111010000001 |
3 | 12210012021001112120001 |
4 | 320112313013322001 |
5 | 1442412322404301 |
6 | 43444353320001 |
7 | 4241366534263 |
oct | 702667077201 |
9 | 183167045501 |
10 | 60513091201 |
11 | 23733076082 |
12 | b889866001 |
13 | 5924b46b54 |
14 | 2d00a95b33 |
15 | 1892804c01 |
hex | e16dc7e81 |
60513091201 has 4 divisors (see below), whose sum is σ = 60731550292. Its totient is φ = 60294632112.
The previous prime is 60513091181. The next prime is 60513091259. The reversal of 60513091201 is 10219031506.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14781696400 + 45731394801 = 121580^2 + 213849^2 .
It is a cyclic number.
It is not a de Polignac number, because 60513091201 - 27 = 60513091073 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 60513091201.
It is not an unprimeable number, because it can be changed into a prime (60513091801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109229130 + ... + 109229683.
It is an arithmetic number, because the mean of its divisors is an integer number (15182887573).
Almost surely, 260513091201 is an apocalyptic number.
It is an amenable number.
60513091201 is a deficient number, since it is larger than the sum of its proper divisors (218459091).
60513091201 is a wasteful number, since it uses less digits than its factorization.
60513091201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218459090.
The product of its (nonzero) digits is 1620, while the sum is 28.
The spelling of 60513091201 in words is "sixty billion, five hundred thirteen million, ninety-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •