Base | Representation |
---|---|
bin | 100010010011111… |
… | …1100001111000111 |
3 | 2222020102011112200 |
4 | 1010213330033013 |
5 | 4324214233111 |
6 | 310124445543 |
7 | 40350032040 |
oct | 10447741707 |
9 | 2866364480 |
10 | 1151321031 |
11 | 540988593 |
12 | 2816a98b3 |
13 | 1546ac463 |
14 | acc9b8c7 |
15 | 6b122256 |
hex | 449fc3c7 |
1151321031 has 24 divisors (see below), whose sum is σ = 1901631264. Its totient is φ = 657538560.
The previous prime is 1151321029. The next prime is 1151321053. The reversal of 1151321031 is 1301231511.
It is not a de Polignac number, because 1151321031 - 21 = 1151321029 is a prime.
It is a super-2 number, since 2×11513210312 = 2651080232845805922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1151320995 and 1151321013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151321021) 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 23 ways as a sum of consecutive naturals, for example, 148491 + ... + 156051.
It is an arithmetic number, because the mean of its divisors is an integer number (79234636).
Almost surely, 21151321031 is an apocalyptic number.
1151321031 is a deficient number, since it is larger than the sum of its proper divisors (750310233).
1151321031 is a wasteful number, since it uses less digits than its factorization.
1151321031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9991 (or 9988 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
The square root of 1151321031 is about 33931.1218647424. The cubic root of 1151321031 is about 1048.0905678848.
Adding to 1151321031 its reverse (1301231511), we get a palindrome (2452552542).
The spelling of 1151321031 in words is "one billion, one hundred fifty-one million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •