Base | Representation |
---|---|
bin | 100010010101001… |
… | …1010111101110110 |
3 | 2222021122012101122 |
4 | 1010222122331312 |
5 | 4324401034230 |
6 | 310150423542 |
7 | 40355410406 |
oct | 10452327566 |
9 | 2867565348 |
10 | 1151971190 |
11 | 541292007 |
12 | 281961bb2 |
13 | 154879376 |
14 | acdca806 |
15 | 6b1eebe5 |
hex | 44a9af76 |
1151971190 has 16 divisors (see below), whose sum is σ = 2077241328. Its totient is φ = 459967776.
The previous prime is 1151971181. The next prime is 1151971211. The reversal of 1151971190 is 911791511.
1151971190 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×11519711902 = 2654075245180032200, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1151971190.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 96677 + ... + 107936.
It is an arithmetic number, because the mean of its divisors is an integer number (129827583).
Almost surely, 21151971190 is an apocalyptic number.
1151971190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1151971190 is a deficient number, since it is larger than the sum of its proper divisors (925270138).
1151971190 is a wasteful number, since it uses less digits than its factorization.
1151971190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205183.
The product of its (nonzero) digits is 2835, while the sum is 35.
The square root of 1151971190 is about 33940.7010829181. The cubic root of 1151971190 is about 1048.2878187728.
The spelling of 1151971190 in words is "one billion, one hundred fifty-one million, nine hundred seventy-one thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •