Base | Representation |
---|---|
bin | 1001100000000000… |
… | …0010000000000111 |
3 | 20120201112210022222 |
4 | 2120000002000013 |
5 | 20210314120111 |
6 | 1101014242555 |
7 | 120123606110 |
oct | 23000020007 |
9 | 6521483288 |
10 | 2550145031 |
11 | 1099543785 |
12 | 5b205645b |
13 | 318438875 |
14 | 1a2985207 |
15 | edd337db |
hex | 98002007 |
2550145031 has 4 divisors (see below), whose sum is σ = 2914451472. Its totient is φ = 2185838592.
The previous prime is 2550145009. The next prime is 2550145051. The reversal of 2550145031 is 1305410552.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2550145031 - 230 = 1476403207 is a prime.
It is a super-2 number, since 2×25501450312 = 13006479358267981922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2550145051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 182153210 + ... + 182153223.
It is an arithmetic number, because the mean of its divisors is an integer number (728612868).
Almost surely, 22550145031 is an apocalyptic number.
2550145031 is a deficient number, since it is larger than the sum of its proper divisors (364306441).
2550145031 is an equidigital number, since it uses as much as digits as its factorization.
2550145031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364306440.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 2550145031 is about 50498.9606922756. The cubic root of 2550145031 is about 1366.2231083336.
Adding to 2550145031 its reverse (1305410552), we get a palindrome (3855555583).
The spelling of 2550145031 in words is "two billion, five hundred fifty million, one hundred forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •