Base | Representation |
---|---|
bin | 1011010111011011… |
… | …0011110100110001 |
3 | 21212122002002202000 |
4 | 2311312303310301 |
5 | 22222031403040 |
6 | 1222430244213 |
7 | 135415306302 |
oct | 26566636461 |
9 | 7778062660 |
10 | 3051044145 |
11 | 1326264696 |
12 | 711956669 |
13 | 398146c86 |
14 | 20d2d27a9 |
15 | 12ccc8130 |
hex | b5db3d31 |
3051044145 has 96 divisors (see below), whose sum is σ = 5887987200. Its totient is φ = 1493807616.
The previous prime is 3051044107. The next prime is 3051044147. The reversal of 3051044145 is 5414401503.
It is a happy number.
3051044145 is a `hidden beast` number, since 3 + 0 + 510 + 4 + 4 + 145 = 666.
It is not a de Polignac number, because 3051044145 - 28 = 3051043889 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (3051044147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4243096 + ... + 4243814.
It is an arithmetic number, because the mean of its divisors is an integer number (61333200).
Almost surely, 23051044145 is an apocalyptic number.
It is an amenable number.
3051044145 is a deficient number, since it is larger than the sum of its proper divisors (2836943055).
3051044145 is a wasteful number, since it uses less digits than its factorization.
3051044145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836 (or 787 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 3051044145 is about 55236.2575216678. The cubic root of 3051044145 is about 1450.3834332782.
Adding to 3051044145 its reverse (5414401503), we get a palindrome (8465445648).
The spelling of 3051044145 in words is "three billion, fifty-one million, forty-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •