Base | Representation |
---|---|
bin | 10011000100000101101… |
… | …01101011110110101011 |
3 | 2022121202011202211102211 |
4 | 21202002311223312223 |
5 | 41213000203442311 |
6 | 1220530001105551 |
7 | 65216154216640 |
oct | 11420265536653 |
9 | 2277664684384 |
10 | 655030140331 |
11 | 23288448a516 |
12 | a6b483282b7 |
13 | 499cc87c918 |
14 | 239bca7ddc7 |
15 | 1208b11e821 |
hex | 9882d6bdab |
655030140331 has 4 divisors (see below), whose sum is σ = 748605874672. Its totient is φ = 561454405992.
The previous prime is 655030140251. The next prime is 655030140509. The reversal of 655030140331 is 133041030556.
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 655030140331 - 221 = 655028043179 is a prime.
It is a super-2 number, since 2×6550301403312 (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 = 655030140293 and 655030140302.
It is not an unprimeable number, because it can be changed into a prime (655030140731) 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, 46787867160 + ... + 46787867173.
It is an arithmetic number, because the mean of its divisors is an integer number (187151468668).
Almost surely, 2655030140331 is an apocalyptic number.
655030140331 is a deficient number, since it is larger than the sum of its proper divisors (93575734341).
655030140331 is an equidigital number, since it uses as much as digits as its factorization.
655030140331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93575734340.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 655030140331 its reverse (133041030556), we get a palindrome (788071170887).
The spelling of 655030140331 in words is "six hundred fifty-five billion, thirty million, one hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •