Base | Representation |
---|---|
bin | 10000101111001010101… |
… | …011001111001100110001 |
3 | 11001221202101120001022210 |
4 | 100233022223033030301 |
5 | 122321010042200423 |
6 | 2240212531322333 |
7 | 146044644536253 |
oct | 20571253171461 |
9 | 4057671501283 |
10 | 1150156600113 |
11 | 403862464024 |
12 | 166aa91503a9 |
13 | 845c8118091 |
14 | 3d94c91dcd3 |
15 | 1edb8e7ab93 |
hex | 10bcaacf331 |
1150156600113 has 4 divisors (see below), whose sum is σ = 1533542133488. Its totient is φ = 766771066740.
The previous prime is 1150156600111. The next prime is 1150156600147. The reversal of 1150156600113 is 3110066510511.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1150156600113 - 21 = 1150156600111 is a prime.
It is a super-2 number, since 2×11501566001132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1150156600111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191692766683 + ... + 191692766688.
It is an arithmetic number, because the mean of its divisors is an integer number (383385533372).
Almost surely, 21150156600113 is an apocalyptic number.
It is an amenable number.
1150156600113 is a deficient number, since it is larger than the sum of its proper divisors (383385533375).
1150156600113 is an equidigital number, since it uses as much as digits as its factorization.
1150156600113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383385533374.
The product of its (nonzero) digits is 2700, while the sum is 30.
The spelling of 1150156600113 in words is "one trillion, one hundred fifty billion, one hundred fifty-six million, six hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •