Base | Representation |
---|---|
bin | 10110011011000011001… |
… | …010100010110011101101 |
3 | 12110022021001200000100210 |
4 | 112123003022202303231 |
5 | 200221201342104401 |
6 | 3135511143413033 |
7 | 216216155051613 |
oct | 26330312426355 |
9 | 5408231600323 |
10 | 1540872613101 |
11 | 544531468588 |
12 | 20a76b154179 |
13 | b23c41c3a83 |
14 | 54815aa56b3 |
15 | 2a13579d4d6 |
hex | 166c32a2ced |
1540872613101 has 16 divisors (see below), whose sum is σ = 2129526088704. Its totient is φ = 990386201904.
The previous prime is 1540872613081. The next prime is 1540872613103. The reversal of 1540872613101 is 1013162780451.
It is not a de Polignac number, because 1540872613101 - 29 = 1540872612589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1540872613101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1540872613103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81544095 + ... + 81562988.
It is an arithmetic number, because the mean of its divisors is an integer number (133095380544).
Almost surely, 21540872613101 is an apocalyptic number.
It is an amenable number.
1540872613101 is a deficient number, since it is larger than the sum of its proper divisors (588653475603).
1540872613101 is a wasteful number, since it uses less digits than its factorization.
1540872613101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163107200.
The product of its (nonzero) digits is 40320, while the sum is 39.
The spelling of 1540872613101 in words is "one trillion, five hundred forty billion, eight hundred seventy-two million, six hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •