Base | Representation |
---|---|
bin | 10110011011100010011… |
… | …011001111011010000100 |
3 | 12110100121121112212212202 |
4 | 112123202123033122010 |
5 | 200223240123140110 |
6 | 3140035200534032 |
7 | 216235154014631 |
oct | 26334233173204 |
9 | 5410547485782 |
10 | 1541397083780 |
11 | 544780519124 |
12 | 20a896921318 |
13 | b2478a66158 |
14 | 548655cb188 |
15 | 2a16684c0a5 |
hex | 166e26cf684 |
1541397083780 has 24 divisors (see below), whose sum is σ = 3245611998552. Its totient is φ = 614905857792.
The previous prime is 1541397083729. The next prime is 1541397083851. The reversal of 1541397083780 is 873807931451.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 455970665536 + 1085426418244 = 675256^2 + 1041838^2 .
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103303337 + ... + 103318256.
It is an arithmetic number, because the mean of its divisors is an integer number (135233833273).
Almost surely, 21541397083780 is an apocalyptic number.
1541397083780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1541397083780 is an abundant number, since it is smaller than the sum of its proper divisors (1704214914772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1541397083780 is a wasteful number, since it uses less digits than its factorization.
1541397083780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206621975 (or 206621973 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 56.
The spelling of 1541397083780 in words is "one trillion, five hundred forty-one billion, three hundred ninety-seven million, eighty-three thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •