Base | Representation |
---|---|
bin | 1011110010001010111101… |
… | …0000111100100000110100 |
3 | 1200212122011001220100001220 |
4 | 2330202233100330200310 |
5 | 3144240014311212300 |
6 | 43320055021350340 |
7 | 2505036452224332 |
oct | 274425720744064 |
9 | 50778131810056 |
10 | 12956561819700 |
11 | 4145935408a34 |
12 | 155309a4083b0 |
13 | 72ca4c502855 |
14 | 32b15ad8cb52 |
15 | 17706ae04da0 |
hex | bc8af43c834 |
12956561819700 has 72 divisors (see below), whose sum is σ = 39460686541920. Its totient is φ = 3273236668800.
The previous prime is 12956561819689. The next prime is 12956561819701. The reversal of 12956561819700 is 791816565921.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12956561819701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1136534811 + ... + 1136546210.
It is an arithmetic number, because the mean of its divisors is an integer number (548065090860).
Almost surely, 212956561819700 is an apocalyptic number.
12956561819700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12956561819700 is an abundant number, since it is smaller than the sum of its proper divisors (26504124722220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12956561819700 is a wasteful number, since it uses less digits than its factorization.
12956561819700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2273081057 (or 2273081050 counting only the distinct ones).
The product of its (nonzero) digits is 8164800, while the sum is 60.
The spelling of 12956561819700 in words is "twelve trillion, nine hundred fifty-six billion, five hundred sixty-one million, eight hundred nineteen thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •