Base | Representation |
---|---|
bin | 111110001111101… |
… | …101010010000110 |
3 | 2200210001012012002 |
4 | 332033231102012 |
5 | 4114320230110 |
6 | 251343025302 |
7 | 34610306036 |
oct | 7617552206 |
9 | 2623035162 |
10 | 1044305030 |
11 | 49653490a |
12 | 25189b232 |
13 | 138480392 |
14 | 9c9a18c6 |
15 | 61a33aa5 |
hex | 3e3ed486 |
1044305030 has 8 divisors (see below), whose sum is σ = 1879749072. Its totient is φ = 417722008.
The previous prime is 1044305027. The next prime is 1044305039. The reversal of 1044305030 is 305034401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1044304993 and 1044305011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044305039) 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 3 ways as a sum of consecutive naturals, for example, 52215242 + ... + 52215261.
It is an arithmetic number, because the mean of its divisors is an integer number (234968634).
Almost surely, 21044305030 is an apocalyptic number.
1044305030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1044305030 is a deficient number, since it is larger than the sum of its proper divisors (835444042).
1044305030 is a wasteful number, since it uses less digits than its factorization.
1044305030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104430510.
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 1044305030 is about 32315.7087188259. The cubic root of 1044305030 is about 1014.5554541749. Note that the first 3 decimals are identical.
Adding to 1044305030 its reverse (305034401), we get a palindrome (1349339431).
The spelling of 1044305030 in words is "one billion, forty-four million, three hundred five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •