Base | Representation |
---|---|
bin | 10000110000001111011… |
… | …100010010110011111101 |
3 | 11002001201210110121122210 |
4 | 100300033130102303331 |
5 | 122330340414420103 |
6 | 2240523223331033 |
7 | 146115354112656 |
oct | 20601734226375 |
9 | 4061653417583 |
10 | 1151310310653 |
11 | 4042a4723908 |
12 | 16716b5b0a79 |
13 | 84750153039 |
14 | 3da1bc4052d |
15 | 1ee353c0e03 |
hex | 10c0f712cfd |
1151310310653 has 4 divisors (see below), whose sum is σ = 1535080414208. Its totient is φ = 767540207100.
The previous prime is 1151310310643. The next prime is 1151310310673. The reversal of 1151310310653 is 3560130131511.
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 1151310310653 - 24 = 1151310310637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1151310310653.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151310310643) 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, 191885051773 + ... + 191885051778.
It is an arithmetic number, because the mean of its divisors is an integer number (383770103552).
Almost surely, 21151310310653 is an apocalyptic number.
It is an amenable number.
1151310310653 is a deficient number, since it is larger than the sum of its proper divisors (383770103555).
1151310310653 is an equidigital number, since it uses as much as digits as its factorization.
1151310310653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383770103554.
The product of its (nonzero) digits is 4050, while the sum is 30.
The spelling of 1151310310653 in words is "one trillion, one hundred fifty-one billion, three hundred ten million, three hundred ten thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •