Base | Representation |
---|---|
bin | 10000110100000000001… |
… | …110111001111101011011 |
3 | 11002110011100001200121102 |
4 | 100310000032321331123 |
5 | 122412124112010133 |
6 | 2242432134302015 |
7 | 146320436620523 |
oct | 20640016717533 |
9 | 4073140050542 |
10 | 1155350110043 |
11 | 405a88020998 |
12 | 167ab84b790b |
13 | 84c4509ab8c |
14 | 3dcc2594683 |
15 | 200beda87e8 |
hex | 10d003b9f5b |
1155350110043 has 8 divisors (see below), whose sum is σ = 1265495050080. Its totient is φ = 1049892188800.
The previous prime is 1155350110037. The next prime is 1155350110067. The reversal of 1155350110043 is 3400110535511.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1155350110043 - 210 = 1155350109019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1155350109988 and 1155350110015.
It is not an unprimeable number, because it can be changed into a prime (1155350110003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1171754183 + ... + 1171755168.
It is an arithmetic number, because the mean of its divisors is an integer number (158186881260).
Almost surely, 21155350110043 is an apocalyptic number.
1155350110043 is a deficient number, since it is larger than the sum of its proper divisors (110144940037).
1155350110043 is a wasteful number, since it uses less digits than its factorization.
1155350110043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2343509397.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 1155350110043 its reverse (3400110535511), we get a palindrome (4555460645554).
The spelling of 1155350110043 in words is "one trillion, one hundred fifty-five billion, three hundred fifty million, one hundred ten thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •