Base | Representation |
---|---|
bin | 11000101011010111… |
… | …00001011111010101 |
3 | 1021012022122021112022 |
4 | 30111223201133111 |
5 | 204113122222124 |
6 | 10030352102525 |
7 | 646212343400 |
oct | 142553413725 |
9 | 37168567468 |
10 | 13248632789 |
11 | 56895649a7 |
12 | 2698b34a45 |
13 | 1331a55cb2 |
14 | 8d97aad37 |
15 | 5281b5c5e |
hex | 315ae17d5 |
13248632789 has 6 divisors (see below), whose sum is σ = 15411674934. Its totient is φ = 11355970920.
The previous prime is 13248632783. The next prime is 13248632801. The reversal of 13248632789 is 98723684231.
It can be written as a sum of positive squares in only one way, i.e., 7865916100 + 5382716689 = 88690^2 + 73367^2 .
It is not a de Polignac number, because 13248632789 - 216 = 13248567253 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13248632789.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13248632783) 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 5 ways as a sum of consecutive naturals, for example, 135190082 + ... + 135190179.
It is an arithmetic number, because the mean of its divisors is an integer number (2568612489).
Almost surely, 213248632789 is an apocalyptic number.
It is an amenable number.
13248632789 is a deficient number, since it is larger than the sum of its proper divisors (2163042145).
13248632789 is an equidigital number, since it uses as much as digits as its factorization.
13248632789 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270380275 (or 270380268 counting only the distinct ones).
The product of its digits is 3483648, while the sum is 53.
The spelling of 13248632789 in words is "thirteen billion, two hundred forty-eight million, six hundred thirty-two thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •