Base | Representation |
---|---|
bin | 100010010010000… |
… | …0101101011101111 |
3 | 2222011111212020201 |
4 | 1010210011223233 |
5 | 4323434424101 |
6 | 310051054331 |
7 | 40335324553 |
oct | 10444055357 |
9 | 2864455221 |
10 | 1150311151 |
11 | 540358880 |
12 | 2812a13a7 |
13 | 1544178b2 |
14 | acab7863 |
15 | 6aec2e01 |
hex | 44905aef |
1150311151 has 8 divisors (see below), whose sum is σ = 1272075984. Its totient is φ = 1031411520.
The previous prime is 1150311143. The next prime is 1150311157. The reversal of 1150311151 is 1511130511.
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 1150311151 - 23 = 1150311143 is a prime.
It is a super-2 number, since 2×11503111512 = 2646431488229889602, 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 (1150311157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 715456 + ... + 717061.
It is an arithmetic number, because the mean of its divisors is an integer number (159009498).
Almost surely, 21150311151 is an apocalyptic number.
1150311151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1150311151 is a deficient number, since it is larger than the sum of its proper divisors (121764833).
1150311151 is a wasteful number, since it uses less digits than its factorization.
1150311151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1432601.
The product of its (nonzero) digits is 75, while the sum is 19.
The square root of 1150311151 is about 33916.2372765612. The cubic root of 1150311151 is about 1047.7840344053.
Adding to 1150311151 its reverse (1511130511), we get a palindrome (2661441662).
The spelling of 1150311151 in words is "one billion, one hundred fifty million, three hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •