Base | Representation |
---|---|
bin | 100010100100110… |
… | …1001011101101001 |
3 | 2222212001002021000 |
4 | 1011021221131221 |
5 | 4334000011113 |
6 | 311042105213 |
7 | 40515113010 |
oct | 10511513551 |
9 | 2885032230 |
10 | 1160157033 |
11 | 545973172 |
12 | 28464b209 |
13 | 156484269 |
14 | b011ba77 |
15 | 6bcba373 |
hex | 45269769 |
1160157033 has 32 divisors (see below), whose sum is σ = 2012209920. Its totient is φ = 646773120.
The previous prime is 1160157001. The next prime is 1160157041. The reversal of 1160157033 is 3307510611.
1160157033 is a `hidden beast` number, since 1 + 1 + 60 + 1 + 570 + 33 = 666.
It is not a de Polignac number, because 1160157033 - 25 = 1160157001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1160156988 and 1160157006.
It is not an unprimeable number, because it can be changed into a prime (1160157073) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67110 + ... + 82607.
It is an arithmetic number, because the mean of its divisors is an integer number (62881560).
Almost surely, 21160157033 is an apocalyptic number.
It is an amenable number.
1160157033 is a deficient number, since it is larger than the sum of its proper divisors (852052887).
1160157033 is a wasteful number, since it uses less digits than its factorization.
1160157033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149774 (or 149768 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
The square root of 1160157033 is about 34061.0779776565. The cubic root of 1160157033 is about 1050.7649853859.
Adding to 1160157033 its reverse (3307510611), we get a palindrome (4467667644).
The spelling of 1160157033 in words is "one billion, one hundred sixty million, one hundred fifty-seven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •