Base | Representation |
---|---|
bin | 10000110000000011000… |
… | …111000010001101100001 |
3 | 11002001012101011000202012 |
4 | 100300003013002031201 |
5 | 122324424433123131 |
6 | 2240450513002305 |
7 | 146110262361053 |
oct | 20600307021541 |
9 | 4061171130665 |
10 | 1151103411041 |
11 | 4041a89590a1 |
12 | 167112253395 |
13 | 8471932142c |
14 | 3d9dc5838d3 |
15 | 1ee2215252b |
hex | 10c031c2361 |
1151103411041 has 4 divisors (see below), whose sum is σ = 1152355972800. Its totient is φ = 1149850849284.
The previous prime is 1151103411019. The next prime is 1151103411047. The reversal of 1151103411041 is 1401143011511.
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 a cyclic number.
It is not a de Polignac number, because 1151103411041 - 222 = 1151099216737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1151103410998 and 1151103411016.
It is not an unprimeable number, because it can be changed into a prime (1151103411047) 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, 626279501 + ... + 626281338.
It is an arithmetic number, because the mean of its divisors is an integer number (288088993200).
Almost surely, 21151103411041 is an apocalyptic number.
It is an amenable number.
1151103411041 is a deficient number, since it is larger than the sum of its proper divisors (1252561759).
1151103411041 is an equidigital number, since it uses as much as digits as its factorization.
1151103411041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1252561758.
The product of its (nonzero) digits is 240, while the sum is 23.
Adding to 1151103411041 its reverse (1401143011511), we get a palindrome (2552246422552).
The spelling of 1151103411041 in words is "one trillion, one hundred fifty-one billion, one hundred three million, four hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •