Base | Representation |
---|---|
bin | 10110011010011000011… |
… | …010001110000010011000 |
3 | 12110020102001220211120110 |
4 | 112122120122032002120 |
5 | 200213214224131130 |
6 | 3135312041124320 |
7 | 216162325030665 |
oct | 26323032160230 |
9 | 5406361824513 |
10 | 1540155302040 |
11 | 5441a3575123 |
12 | 20a5aaa896a0 |
13 | b230b703164 |
14 | 54788702a6c |
15 | 2a0e280bab0 |
hex | 1669868e098 |
1540155302040 has 128 divisors (see below), whose sum is σ = 4626812171520. Its totient is φ = 410144448000.
The previous prime is 1540155301963. The next prime is 1540155302057. The reversal of 1540155302040 is 402035510451.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 1540155301989 and 1540155302007.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 431293455 + ... + 431297025.
It is an arithmetic number, because the mean of its divisors is an integer number (36146970090).
Almost surely, 21540155302040 is an apocalyptic number.
1540155302040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1540155302040 is an abundant number, since it is smaller than the sum of its proper divisors (3086656869480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1540155302040 is a wasteful number, since it uses less digits than its factorization.
1540155302040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7513 (or 7509 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
The spelling of 1540155302040 in words is "one trillion, five hundred forty billion, one hundred fifty-five million, three hundred two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •