Base | Representation |
---|---|
bin | 100010010100001… |
… | …0110110110000011 |
3 | 2222020121201001021 |
4 | 1010220112312003 |
5 | 4324231230034 |
6 | 310131050311 |
7 | 40350664555 |
oct | 10450266603 |
9 | 2866551037 |
10 | 1151430019 |
11 | 540a52463 |
12 | 281740997 |
13 | 154719c4c |
14 | accc94d5 |
15 | 6b1446b4 |
hex | 44a16d83 |
1151430019 has 8 divisors (see below), whose sum is σ = 1182091680. Its totient is φ = 1120891200.
The previous prime is 1151430011. The next prime is 1151430023. The reversal of 1151430019 is 9100341511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1151430019 - 23 = 1151430011 is a prime.
It is a super-2 number, since 2×11514300192 = 2651582177308680722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1151429975 and 1151430002.
It is not an unprimeable number, because it can be changed into a prime (1151430011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11559 + ... + 49360.
It is an arithmetic number, because the mean of its divisors is an integer number (147761460).
Almost surely, 21151430019 is an apocalyptic number.
1151430019 is a deficient number, since it is larger than the sum of its proper divisors (30661661).
1151430019 is an equidigital number, since it uses as much as digits as its factorization.
1151430019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61421.
The product of its (nonzero) digits is 540, while the sum is 25.
The square root of 1151430019 is about 33932.7278449582. The cubic root of 1151430019 is about 1048.1236387913.
The spelling of 1151430019 in words is "one billion, one hundred fifty-one million, four hundred thirty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •