Base | Representation |
---|---|
bin | 10000101111011100001… |
… | …011000011110000001001 |
3 | 11001222111211221011020200 |
4 | 100233130023003300021 |
5 | 122322110214421010 |
6 | 2240302015242413 |
7 | 146055140652051 |
oct | 20573413036011 |
9 | 4058454834220 |
10 | 1150450154505 |
11 | 4039a3135863 |
12 | 166b6b519409 |
13 | 84643b9a0c2 |
14 | 3d9798d6561 |
15 | 1edd4b14cc0 |
hex | 10bdc2c3c09 |
1150450154505 has 48 divisors (see below), whose sum is σ = 2105884400256. Its totient is φ = 579825227520.
The previous prime is 1150450154443. The next prime is 1150450154509. The reversal of 1150450154505 is 5054510540511.
1150450154505 is a `hidden beast` number, since 1 + 1 + 5 + 0 + 450 + 154 + 50 + 5 = 666.
It is not a de Polignac number, because 1150450154505 - 216 = 1150450088969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1150450154505.
It is not an unprimeable number, because it can be changed into a prime (1150450154509) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6610156 + ... + 6781965.
It is an arithmetic number, because the mean of its divisors is an integer number (43872591672).
Almost surely, 21150450154505 is an apocalyptic number.
1150450154505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1150450154505 is a deficient number, since it is larger than the sum of its proper divisors (955434245751).
1150450154505 is a wasteful number, since it uses less digits than its factorization.
1150450154505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13392238 (or 13392235 counting only the distinct ones).
The product of its (nonzero) digits is 50000, while the sum is 36.
The spelling of 1150450154505 in words is "one trillion, one hundred fifty billion, four hundred fifty million, one hundred fifty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •