Base | Representation |
---|---|
bin | 11000010000100000… |
… | …00010101111011001 |
3 | 1020121121200110112202 |
4 | 30020100002233121 |
5 | 203132432401040 |
6 | 5552143015545 |
7 | 640505302655 |
oct | 141020025731 |
9 | 36547613482 |
10 | 13023325145 |
11 | 5583366a36 |
12 | 263559a5b5 |
13 | 12c717a76c |
14 | 8b78bba65 |
15 | 51350d015 |
hex | 308402bd9 |
13023325145 has 8 divisors (see below), whose sum is σ = 15766291656. Its totient is φ = 10326459136.
The previous prime is 13023325141. The next prime is 13023325163. The reversal of 13023325145 is 54152332031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1370554441 + 11652770704 = 37021^2 + 107948^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13023325145 - 22 = 13023325141 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13023325141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11524502 + ... + 11525631.
It is an arithmetic number, because the mean of its divisors is an integer number (1970786457).
Almost surely, 213023325145 is an apocalyptic number.
It is an amenable number.
13023325145 is a deficient number, since it is larger than the sum of its proper divisors (2742966511).
13023325145 is a wasteful number, since it uses less digits than its factorization.
13023325145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23050251.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 13023325145 its reverse (54152332031), we get a palindrome (67175657176).
The spelling of 13023325145 in words is "thirteen billion, twenty-three million, three hundred twenty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •