Base | Representation |
---|---|
bin | 10011000000011010110… |
… | …10100101100100101001 |
3 | 2022102122212210112111112 |
4 | 21200031122211210221 |
5 | 41144431341234231 |
6 | 1220002304240105 |
7 | 65116303165145 |
oct | 11401532454451 |
9 | 2272585715445 |
10 | 653060102441 |
11 | 231a6344792a |
12 | a6698610035 |
13 | 49777696226 |
14 | 23873184225 |
15 | 11ec31c992b |
hex | 980d6a5929 |
653060102441 has 8 divisors (see below), whose sum is σ = 687484190400. Its totient is φ = 618641264880.
The previous prime is 653060102423. The next prime is 653060102609. The reversal of 653060102441 is 144201060356.
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 653060102441 - 26 = 653060102377 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 653060102398 and 653060102407.
It is not an unprimeable number, because it can be changed into a prime (653060102411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1055990 + ... + 1556031.
It is an arithmetic number, because the mean of its divisors is an integer number (85935523800).
Almost surely, 2653060102441 is an apocalyptic number.
It is an amenable number.
653060102441 is a deficient number, since it is larger than the sum of its proper divisors (34424087959).
653060102441 is a wasteful number, since it uses less digits than its factorization.
653060102441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2625199.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 653060102441 its reverse (144201060356), we get a palindrome (797261162797).
The spelling of 653060102441 in words is "six hundred fifty-three billion, sixty million, one hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •