Base | Representation |
---|---|
bin | 1001100101100101011101… |
… | …0011000010000011000100 |
3 | 1101022201222022200110121011 |
4 | 2121121113103002003010 |
5 | 2340202102433220200 |
6 | 34230340222132004 |
7 | 2135404411406515 |
oct | 231312723020304 |
9 | 41281868613534 |
10 | 10541314351300 |
11 | 33a460115a0a7 |
12 | 1222b88a21004 |
13 | 5b6070749ac5 |
14 | 2862b92d8a0c |
15 | 13430cb355ba |
hex | 996574c20c4 |
10541314351300 has 18 divisors (see below), whose sum is σ = 22874652142538. Its totient is φ = 4216525740480.
The previous prime is 10541314351259. The next prime is 10541314351313. The reversal of 10541314351300 is 315341314501.
It can be written as a sum of positive squares in 3 ways, for example, as 501085599876 + 10040228751424 = 707874^2 + 3168632^2 .
It is a super-2 number, since 2×105413143513002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 52706571657 + ... + 52706571856.
Almost surely, 210541314351300 is an apocalyptic number.
10541314351300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10541314351300 is an abundant number, since it is smaller than the sum of its proper divisors (12333337791238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10541314351300 is a wasteful number, since it uses less digits than its factorization.
10541314351300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105413143527 (or 105413143520 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 10541314351300 its reverse (315341314501), we get a palindrome (10856655665801).
The spelling of 10541314351300 in words is "ten trillion, five hundred forty-one billion, three hundred fourteen million, three hundred fifty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •