Base | Representation |
---|---|
bin | 1110011011010… |
… | …0000010100000 |
3 | 11012212001000001 |
4 | 3212310002200 |
5 | 110442200042 |
6 | 10000505344 |
7 | 1333203061 |
oct | 346640240 |
9 | 135761001 |
10 | 60506272 |
11 | 31177292 |
12 | 1831b254 |
13 | c6c6538 |
14 | 8070568 |
15 | 54a2bb7 |
hex | 39b40a0 |
60506272 has 48 divisors (see below), whose sum is σ = 122171112. Its totient is φ = 29491200.
The previous prime is 60506263. The next prime is 60506273. The reversal of 60506272 is 27260506.
It can be written as a sum of positive squares in 4 ways, for example, as 56490256 + 4016016 = 7516^2 + 2004^2 .
It is a super-2 number, since 2×605062722 = 7322017902675968, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 60506272.
It is not an unprimeable number, because it can be changed into a prime (60506273) 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, 313408 + ... + 313600.
Almost surely, 260506272 is an apocalyptic number.
It is an amenable number.
60506272 is an abundant number, since it is smaller than the sum of its proper divisors (61664840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
60506272 is a wasteful number, since it uses less digits than its factorization.
60506272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 401 (or 393 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 60506272 is about 7778.5777620334. The cubic root of 60506272 is about 392.5847859353.
Adding to 60506272 its reverse (27260506), we get a palindrome (87766778).
It can be divided in two parts, 6050 and 6272, that multiplied together give a square (37945600 = 61602).
The spelling of 60506272 in words is "sixty million, five hundred six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •