Base | Representation |
---|---|
bin | 1011010010101010… |
… | …0010011110101011 |
3 | 21211020110022010212 |
4 | 2310222202132223 |
5 | 22201422101110 |
6 | 1220433531335 |
7 | 135053333630 |
oct | 26452423653 |
9 | 7736408125 |
10 | 3031050155 |
11 | 1315a48931 |
12 | 707113b4b |
13 | 393c66503 |
14 | 20a7aa187 |
15 | 12b178e05 |
hex | b4aa27ab |
3031050155 has 16 divisors (see below), whose sum is σ = 4213815744. Its totient is φ = 2049960960.
The previous prime is 3031050089. The next prime is 3031050157. The reversal of 3031050155 is 5510501303.
It is not a de Polignac number, because 3031050155 - 218 = 3030788011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3031050155.
It is not an unprimeable number, because it can be changed into a prime (3031050157) 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 15 ways as a sum of consecutive naturals, for example, 590606 + ... + 595715.
It is an arithmetic number, because the mean of its divisors is an integer number (263363484).
Almost surely, 23031050155 is an apocalyptic number.
3031050155 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3031050155 is a deficient number, since it is larger than the sum of its proper divisors (1182765589).
3031050155 is a wasteful number, since it uses less digits than its factorization.
3031050155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1186406.
The product of its (nonzero) digits is 1125, while the sum is 23.
The square root of 3031050155 is about 55054.9739351496. The cubic root of 3031050155 is about 1447.2082876490.
Adding to 3031050155 its reverse (5510501303), we get a palindrome (8541551458).
The spelling of 3031050155 in words is "three billion, thirty-one million, fifty thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •