Base | Representation |
---|---|
bin | 11000101101000000… |
… | …01111010110100111 |
3 | 1021020021122101002221 |
4 | 30112200033112213 |
5 | 204130141432020 |
6 | 10032004213211 |
7 | 646440661132 |
oct | 142640172647 |
9 | 37207571087 |
10 | 13262452135 |
11 | 5696343649 |
12 | 26a169a207 |
13 | 133488411a |
14 | 8db567219 |
15 | 5294e56aa |
hex | 31680f5a7 |
13262452135 has 8 divisors (see below), whose sum is σ = 15915659760. Its totient is φ = 10609483584.
The previous prime is 13262452123. The next prime is 13262452169. The reversal of 13262452135 is 53125426231.
13262452135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 13262452135 - 29 = 13262451623 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13262452135.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 102171 + ... + 192259.
It is an arithmetic number, because the mean of its divisors is an integer number (1989457470).
Almost surely, 213262452135 is an apocalyptic number.
13262452135 is a deficient number, since it is larger than the sum of its proper divisors (2653207625).
13262452135 is an equidigital number, since it uses as much as digits as its factorization.
13262452135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119537.
The product of its digits is 43200, while the sum is 34.
Adding to 13262452135 its reverse (53125426231), we get a palindrome (66387878366).
The spelling of 13262452135 in words is "thirteen billion, two hundred sixty-two million, four hundred fifty-two thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •