Base | Representation |
---|---|
bin | 1100100001000110010… |
… | …1111101110110010011 |
3 | 202120001202100012022001 |
4 | 3020101211331312103 |
5 | 12010402120431011 |
6 | 242442321054431 |
7 | 21351656563303 |
oct | 3102145756623 |
9 | 676052305261 |
10 | 215043530131 |
11 | 83221515031 |
12 | 35815787417 |
13 | 17380b997b1 |
14 | a59ddd7603 |
15 | 58d8ed67c1 |
hex | 321197dd93 |
215043530131 has 4 divisors (see below), whose sum is σ = 215392061592. Its totient is φ = 214694998672.
The previous prime is 215043530129. The next prime is 215043530213. The reversal of 215043530131 is 131035340512.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 215043530131 - 21 = 215043530129 is a prime.
It is a super-2 number, since 2×2150435301312 (a number of 23 digits) contains 22 as substring.
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 215043530131.
It is not an unprimeable number, because it can be changed into a prime (215043530101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174264805 + ... + 174266038.
It is an arithmetic number, because the mean of its divisors is an integer number (53848015398).
Almost surely, 2215043530131 is an apocalyptic number.
215043530131 is a deficient number, since it is larger than the sum of its proper divisors (348531461).
215043530131 is an equidigital number, since it uses as much as digits as its factorization.
215043530131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 348531460.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 215043530131 its reverse (131035340512), we get a palindrome (346078870643).
The spelling of 215043530131 in words is "two hundred fifteen billion, forty-three million, five hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •