Base | Representation |
---|---|
bin | 11000010011111110… |
… | …01010011010000011 |
3 | 1020200122111101112220 |
4 | 30021333022122003 |
5 | 203212412021111 |
6 | 5555103222123 |
7 | 641311014204 |
oct | 141177123203 |
9 | 36618441486 |
10 | 13052454531 |
11 | 5598852306 |
12 | 26432a7943 |
13 | 130020939c |
14 | 8bb7015ab |
15 | 515d63e06 |
hex | 309fca683 |
13052454531 has 64 divisors (see below), whose sum is σ = 19696763520. Its totient is φ = 7648542720.
The previous prime is 13052454469. The next prime is 13052454557. The reversal of 13052454531 is 13545425031.
13052454531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13052454531 - 27 = 13052454403 is a prime.
It is a super-2 number, since 2×130524545312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13052454492 and 13052454501.
It is not an unprimeable number, because it can be changed into a prime (13052454581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5721111 + ... + 5723391.
It is an arithmetic number, because the mean of its divisors is an integer number (307761930).
Almost surely, 213052454531 is an apocalyptic number.
13052454531 is a deficient number, since it is larger than the sum of its proper divisors (6644308989).
13052454531 is a wasteful number, since it uses less digits than its factorization.
13052454531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2456.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 13052454531 its reverse (13545425031), we get a palindrome (26597879562).
The spelling of 13052454531 in words is "thirteen billion, fifty-two million, four hundred fifty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •