Base | Representation |
---|---|
bin | 11001001110010110… |
… | …01101010100001011 |
3 | 1021221202221120102021 |
4 | 30213023031110023 |
5 | 210213242321220 |
6 | 10115435145311 |
7 | 656405250031 |
oct | 144713152413 |
9 | 37852846367 |
10 | 13542151435 |
11 | 581a21189a |
12 | 275b2a5237 |
13 | 137a7c4977 |
14 | 926774551 |
15 | 543d444aa |
hex | 3272cd50b |
13542151435 has 4 divisors (see below), whose sum is σ = 16250581728. Its totient is φ = 10833721144.
The previous prime is 13542151411. The next prime is 13542151453. The reversal of 13542151435 is 53415124531.
13542151435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13542151435 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13542151435.
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 3 ways as a sum of consecutive naturals, for example, 1354215139 + ... + 1354215148.
It is an arithmetic number, because the mean of its divisors is an integer number (4062645432).
Almost surely, 213542151435 is an apocalyptic number.
13542151435 is a deficient number, since it is larger than the sum of its proper divisors (2708430293).
13542151435 is an equidigital number, since it uses as much as digits as its factorization.
13542151435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2708430292.
The product of its digits is 36000, while the sum is 34.
Adding to 13542151435 its reverse (53415124531), we get a palindrome (66957275966).
The spelling of 13542151435 in words is "thirteen billion, five hundred forty-two million, one hundred fifty-one thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •