Base | Representation |
---|---|
bin | 1011100100001011111010… |
… | …0100111111000001101100 |
3 | 1200000122222211221212121220 |
4 | 2321002332210333001230 |
5 | 3131320440421000130 |
6 | 43013442101023340 |
7 | 2451502532231001 |
oct | 271027644770154 |
9 | 50018884855556 |
10 | 12716300562540 |
11 | 4062a53177393 |
12 | 15146073b4b50 |
13 | 7131acc798b3 |
14 | 31d687b338a8 |
15 | 170ba808e410 |
hex | b90be93f06c |
12716300562540 has 24 divisors (see below), whose sum is σ = 35605641575280. Its totient is φ = 3391013483328.
The previous prime is 12716300562521. The next prime is 12716300562557. The reversal of 12716300562540 is 4526500361721.
It is a junction number, because it is equal to n+sod(n) for n = 12716300562492 and 12716300562501.
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 7 ways as a sum of consecutive naturals, for example, 105969171295 + ... + 105969171414.
It is an arithmetic number, because the mean of its divisors is an integer number (1483568398970).
Almost surely, 212716300562540 is an apocalyptic number.
12716300562540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12716300562540 is an abundant number, since it is smaller than the sum of its proper divisors (22889341012740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12716300562540 is a wasteful number, since it uses less digits than its factorization.
12716300562540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211938342721 (or 211938342719 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 12716300562540 in words is "twelve trillion, seven hundred sixteen billion, three hundred million, five hundred sixty-two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •