Base | Representation |
---|---|
bin | 1001010100000100100111… |
… | …1000001111110010001001 |
3 | 1100020222100222100202202001 |
4 | 2111001021320033302021 |
5 | 2320234411011441040 |
6 | 33440221025111001 |
7 | 2104563454452262 |
oct | 225011170176211 |
9 | 40228328322661 |
10 | 10240441515145 |
11 | 3298a462a4106 |
12 | 11947bb188461 |
13 | 593891b458ca |
14 | 2758d62ab969 |
15 | 12b59da1359a |
hex | 95049e0fc89 |
10240441515145 has 24 divisors (see below), whose sum is σ = 12850543008072. Its totient is φ = 7833419193600.
The previous prime is 10240441515133. The next prime is 10240441515167. The reversal of 10240441515145 is 54151514404201.
It can be written as a sum of positive squares in 4 ways, for example, as 2240323426441 + 8000118088704 = 1496771^2 + 2828448^2 .
It is a de Polignac number, because none of the positive numbers 2k-10240441515145 is a prime.
It is a Duffinian number.
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 23 ways as a sum of consecutive naturals, for example, 6890725 + ... + 8243965.
It is an arithmetic number, because the mean of its divisors is an integer number (535439292003).
Almost surely, 210240441515145 is an apocalyptic number.
It is an amenable number.
10240441515145 is a deficient number, since it is larger than the sum of its proper divisors (2610101492927).
10240441515145 is a wasteful number, since it uses less digits than its factorization.
10240441515145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356153 (or 1356130 counting only the distinct ones).
The product of its (nonzero) digits is 64000, while the sum is 37.
Adding to 10240441515145 its reverse (54151514404201), we get a palindrome (64391955919346).
The spelling of 10240441515145 in words is "ten trillion, two hundred forty billion, four hundred forty-one million, five hundred fifteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •