Base | Representation |
---|---|
bin | 10011000000100001000… |
… | …01011111001101010111 |
3 | 2022102210111220112221111 |
4 | 21200100201133031113 |
5 | 41200033213234111 |
6 | 1220011405555451 |
7 | 65120505316423 |
oct | 11402041371527 |
9 | 2272714815844 |
10 | 653112243031 |
11 | 231a8a91a926 |
12 | a66b1b75b87 |
13 | 49785420a51 |
14 | 2387a077b83 |
15 | 11ec7a78a21 |
hex | 981085f357 |
653112243031 has 4 divisors (see below), whose sum is σ = 653177899000. Its totient is φ = 653046587064.
The previous prime is 653112243013. The next prime is 653112243061. The reversal of 653112243031 is 130342211356.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 653112243031 - 25 = 653112242999 is a prime.
It is a super-2 number, since 2×6531122430312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 653112242984 and 653112243002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (653112243011) 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, 32813061 + ... + 32832958.
It is an arithmetic number, because the mean of its divisors is an integer number (163294474750).
Almost surely, 2653112243031 is an apocalyptic number.
653112243031 is a deficient number, since it is larger than the sum of its proper divisors (65655969).
653112243031 is an equidigital number, since it uses as much as digits as its factorization.
653112243031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65655968.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 653112243031 its reverse (130342211356), we get a palindrome (783454454387).
The spelling of 653112243031 in words is "six hundred fifty-three billion, one hundred twelve million, two hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •