Base | Representation |
---|---|
bin | 1010010001110101000000… |
… | …0001000100010110010100 |
3 | 1111000101220002120212022011 |
4 | 2210131100001010112110 |
5 | 2440130232230204022 |
6 | 40011443033514004 |
7 | 2244333156005134 |
oct | 244352001042624 |
9 | 44011802525264 |
10 | 11301401413012 |
11 | 366799651a587 |
12 | 1326354572904 |
13 | 63c9436a7619 |
14 | 2b0dc2876ac4 |
15 | 148e96ddb977 |
hex | a4750044594 |
11301401413012 has 12 divisors (see below), whose sum is σ = 19779404330196. Its totient is φ = 5650143032960.
The previous prime is 11301401412989. The next prime is 11301401413013. The reversal of 11301401413012 is 21031410410311.
It can be written as a sum of positive squares in 2 ways, for example, as 10629073571076 + 672327841936 = 3260226^2 + 819956^2 .
It is a super-3 number, since 3×113014014130123 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11301401413013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 139372789 + ... + 139453852.
It is an arithmetic number, because the mean of its divisors is an integer number (1648283694183).
Almost surely, 211301401413012 is an apocalyptic number.
It is an amenable number.
11301401413012 is a deficient number, since it is larger than the sum of its proper divisors (8478002917184).
11301401413012 is a wasteful number, since it uses less digits than its factorization.
11301401413012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278836778 (or 278836776 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 11301401413012 its reverse (21031410410311), we get a palindrome (32332811823323).
The spelling of 11301401413012 in words is "eleven trillion, three hundred one billion, four hundred one million, four hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •