Base | Representation |
---|---|
bin | 100010011101001… |
… | …0000100001101011 |
3 | 2222120110010020102 |
4 | 1010322100201223 |
5 | 4331431411411 |
6 | 310415420015 |
7 | 40435611131 |
oct | 10472204153 |
9 | 2876403212 |
10 | 1156122731 |
11 | 543668135 |
12 | 28322460b |
13 | 1556a0bba |
14 | ad78b751 |
15 | 6b76ed3b |
hex | 44e9086b |
1156122731 has 4 divisors (see below), whose sum is σ = 1156369032. Its totient is φ = 1155876432.
The previous prime is 1156122719. The next prime is 1156122739. The reversal of 1156122731 is 1372216511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1156122731 is a prime.
It is a super-2 number, since 2×11561227312 = 2673239538269796722, 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 = 1156122694 and 1156122703.
It is not an unprimeable number, because it can be changed into a prime (1156122739) 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 3 ways as a sum of consecutive naturals, for example, 115970 + ... + 125543.
It is an arithmetic number, because the mean of its divisors is an integer number (289092258).
Almost surely, 21156122731 is an apocalyptic number.
1156122731 is a deficient number, since it is larger than the sum of its proper divisors (246301).
1156122731 is an equidigital number, since it uses as much as digits as its factorization.
1156122731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246300.
The product of its digits is 2520, while the sum is 29.
The square root of 1156122731 is about 34001.8048197445. The cubic root of 1156122731 is about 1049.5456026278.
The spelling of 1156122731 in words is "one billion, one hundred fifty-six million, one hundred twenty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •