Base | Representation |
---|---|
bin | 10000001110110110000… |
… | …010000101100110011001 |
3 | 10221122011122222000200001 |
4 | 100032312002011212121 |
5 | 121233420313431301 |
6 | 2212233024013001 |
7 | 143405622032050 |
oct | 20166602054631 |
9 | 3848148860601 |
10 | 1115450530201 |
11 | 3a0072821017 |
12 | 160222161161 |
13 | 81256a78437 |
14 | 3bdb9487397 |
15 | 1e03710ac01 |
hex | 103b6085999 |
1115450530201 has 8 divisors (see below), whose sum is σ = 1284105720960. Its totient is φ = 949121618208.
The previous prime is 1115450530121. The next prime is 1115450530211. The reversal of 1115450530201 is 1020350545111.
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 1115450530201 - 215 = 1115450497433 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 1115450530201.
It is not an unprimeable number, because it can be changed into a prime (1115450530211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 581568661 + ... + 581570578.
It is an arithmetic number, because the mean of its divisors is an integer number (160513215120).
Almost surely, 21115450530201 is an apocalyptic number.
It is an amenable number.
1115450530201 is a deficient number, since it is larger than the sum of its proper divisors (168655190759).
1115450530201 is a wasteful number, since it uses less digits than its factorization.
1115450530201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163139383.
The product of its (nonzero) digits is 3000, while the sum is 28.
The spelling of 1115450530201 in words is "one trillion, one hundred fifteen billion, four hundred fifty million, five hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •