Base | Representation |
---|---|
bin | 11011010110011101101110… |
… | …01111110110101000101001 |
3 | 21212221212001102000010011112 |
4 | 31223032313033312220221 |
5 | 30340410441331313421 |
6 | 331530243435040105 |
7 | 15445240410623222 |
oct | 1553166717665051 |
9 | 255855042003145 |
10 | 60145501432361 |
11 | 18189622628864 |
12 | 68b47268a0035 |
13 | 27739091360b7 |
14 | 10bd0b4872249 |
15 | 6e47c877845b |
hex | 36b3b73f6a29 |
60145501432361 has 4 divisors (see below), whose sum is σ = 62760523233792. Its totient is φ = 57530479630932.
The previous prime is 60145501432301. The next prime is 60145501432363. The reversal of 60145501432361 is 16323410554106.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 60145501432361 - 214 = 60145501415977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60145501432363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1307510900681 + ... + 1307510900726.
It is an arithmetic number, because the mean of its divisors is an integer number (15690130808448).
Almost surely, 260145501432361 is an apocalyptic number.
It is an amenable number.
60145501432361 is a deficient number, since it is larger than the sum of its proper divisors (2615021801431).
60145501432361 is a wasteful number, since it uses less digits than its factorization.
60145501432361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2615021801430.
The product of its (nonzero) digits is 259200, while the sum is 41.
Adding to 60145501432361 its reverse (16323410554106), we get a palindrome (76468911986467).
The spelling of 60145501432361 in words is "sixty trillion, one hundred forty-five billion, five hundred one million, four hundred thirty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •