Base | Representation |
---|---|
bin | 1001100100000100001011… |
… | …1000110111110010100001 |
3 | 1101020020120111221222011122 |
4 | 2121001002320313302201 |
5 | 2334240113222123231 |
6 | 34210341151022025 |
7 | 2133461340334460 |
oct | 231010270676241 |
9 | 41206514858148 |
10 | 10515202145441 |
11 | 3394521531384 |
12 | 1219abbb0a915 |
13 | 5b376b97b016 |
14 | 284d1d3569d7 |
15 | 1337d04ba77b |
hex | 99042e37ca1 |
10515202145441 has 32 divisors (see below), whose sum is σ = 13213097187840. Its totient is φ = 8159197326336.
The previous prime is 10515202145419. The next prime is 10515202145447. The reversal of 10515202145441 is 14454120251501.
It is not a de Polignac number, because 10515202145441 - 234 = 10498022276257 is a prime.
It is a super-2 number, since 2×105152021454412 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10515202145447) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 4885166 + ... + 6700391.
It is an arithmetic number, because the mean of its divisors is an integer number (412909287120).
Almost surely, 210515202145441 is an apocalyptic number.
It is an amenable number.
10515202145441 is a deficient number, since it is larger than the sum of its proper divisors (2697895042399).
10515202145441 is a wasteful number, since it uses less digits than its factorization.
10515202145441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11585873.
The product of its (nonzero) digits is 32000, while the sum is 35.
Adding to 10515202145441 its reverse (14454120251501), we get a palindrome (24969322396942).
The spelling of 10515202145441 in words is "ten trillion, five hundred fifteen billion, two hundred two million, one hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •