Base | Representation |
---|---|
bin | 10000000010110011111… |
… | …100001111001111010101 |
3 | 10220101211020201112201000 |
4 | 100002303330033033111 |
5 | 121030440304244001 |
6 | 2202255011453513 |
7 | 142440506652435 |
oct | 20026374171725 |
9 | 3811736645630 |
10 | 1102530540501 |
11 | 395642824585 |
12 | 1598172b7299 |
13 | 7cc7813b710 |
14 | 3b5115c82c5 |
15 | 1da2cc10a86 |
hex | 100b3f0f3d5 |
1102530540501 has 32 divisors (see below), whose sum is σ = 1775462613120. Its totient is φ = 672139372032.
The previous prime is 1102530540491. The next prime is 1102530540571. The reversal of 1102530540501 is 1050450352011.
1102530540501 is a `hidden beast` number, since 1 + 1 + 0 + 253 + 0 + 5 + 405 + 0 + 1 = 666.
It is not a de Polignac number, because 1102530540501 - 213 = 1102530532309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102530540571) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14640540 + ... + 14715653.
It is an arithmetic number, because the mean of its divisors is an integer number (55483206660).
Almost surely, 21102530540501 is an apocalyptic number.
It is an amenable number.
1102530540501 is a deficient number, since it is larger than the sum of its proper divisors (672932072619).
1102530540501 is a wasteful number, since it uses less digits than its factorization.
1102530540501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29356322 (or 29356316 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 1102530540501 its reverse (1050450352011), we get a palindrome (2152980892512).
The spelling of 1102530540501 in words is "one trillion, one hundred two billion, five hundred thirty million, five hundred forty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •