Base | Representation |
---|---|
bin | 10000101111011010001… |
… | …001101111001101100111 |
3 | 11001222102111010211012222 |
4 | 100233122021233031213 |
5 | 122322023030110144 |
6 | 2240254404502555 |
7 | 146054246546141 |
oct | 20573211571547 |
9 | 4058374124188 |
10 | 1150416253799 |
11 | 403985a9074a |
12 | 166b600aaa5b |
13 | 84639b5a807 |
14 | 3d9751cdc91 |
15 | 1edd1b6a2ee |
hex | 10bda26f367 |
1150416253799 has 4 divisors (see below), whose sum is σ = 1152676404120. Its totient is φ = 1148156103480.
The previous prime is 1150416253787. The next prime is 1150416253801. The reversal of 1150416253799 is 9973526140511.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1150416253799 - 28 = 1150416253543 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1150416253799.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1150416253709) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1130074397 + ... + 1130075414.
It is an arithmetic number, because the mean of its divisors is an integer number (288169101030).
Almost surely, 21150416253799 is an apocalyptic number.
1150416253799 is a deficient number, since it is larger than the sum of its proper divisors (2260150321).
1150416253799 is an equidigital number, since it uses as much as digits as its factorization.
1150416253799 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2260150320.
The product of its (nonzero) digits is 2041200, while the sum is 53.
The spelling of 1150416253799 in words is "one trillion, one hundred fifty billion, four hundred sixteen million, two hundred fifty-three thousand, seven hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •