Base | Representation |
---|---|
bin | 1101110001010101110011… |
… | …0001010011010101101100 |
3 | 1222121111101100121102121220 |
4 | 3130111130301103111230 |
5 | 3441033403413142130 |
6 | 52111454041023340 |
7 | 3121631633465613 |
oct | 334253461232554 |
9 | 58544340542556 |
10 | 15141316146540 |
11 | 490843a260031 |
12 | 18465a4184b50 |
13 | 85aa87680bbc |
14 | 3a4bb4c2887a |
15 | 1b3cd8bb5410 |
hex | dc55cc5356c |
15141316146540 has 48 divisors (see below), whose sum is σ = 43114256156160. Its totient is φ = 3969248977600.
The previous prime is 15141316146533. The next prime is 15141316146629. The reversal of 15141316146540 is 4564161314151.
It is a junction number, because it is equal to n+sod(n) for n = 15141316146492 and 15141316146501.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2138600436 + ... + 2138607515.
It is an arithmetic number, because the mean of its divisors is an integer number (898213669920).
Almost surely, 215141316146540 is an apocalyptic number.
15141316146540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15141316146540 is an abundant number, since it is smaller than the sum of its proper divisors (27972940009620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15141316146540 is a wasteful number, since it uses less digits than its factorization.
15141316146540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4277208022 (or 4277208020 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 42.
The spelling of 15141316146540 in words is "fifteen trillion, one hundred forty-one billion, three hundred sixteen million, one hundred forty-six thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •