Base | Representation |
---|---|
bin | 1001100100000101000111… |
… | …0000001111001101011010 |
3 | 1101020021012220020112121210 |
4 | 2121001101300033031122 |
5 | 2334241121043242224 |
6 | 34210422020243550 |
7 | 2133500456216310 |
oct | 231012160171532 |
9 | 41207186215553 |
10 | 10515451540314 |
11 | 339463a291446 |
12 | 1219b6b5405b6 |
13 | 5b37ab53b156 |
14 | 284d445160b0 |
15 | 1337e7330429 |
hex | 99051c0f35a |
10515451540314 has 16 divisors (see below), whose sum is σ = 24035317806528. Its totient is φ = 3004414725792.
The previous prime is 10515451540291. The next prime is 10515451540327. The reversal of 10515451540314 is 41304515451501.
It is a super-2 number, since 2×105154515403142 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125183946867 + ... + 125183946950.
It is an arithmetic number, because the mean of its divisors is an integer number (1502207362908).
Almost surely, 210515451540314 is an apocalyptic number.
10515451540314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10515451540314 is an abundant number, since it is smaller than the sum of its proper divisors (13519866266214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10515451540314 is a wasteful number, since it uses less digits than its factorization.
10515451540314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250367893829.
The product of its (nonzero) digits is 120000, while the sum is 39.
Adding to 10515451540314 its reverse (41304515451501), we get a palindrome (51819966991815).
The spelling of 10515451540314 in words is "ten trillion, five hundred fifteen billion, four hundred fifty-one million, five hundred forty thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •