Base | Representation |
---|---|
bin | 1100100001001011100… |
… | …1001101000011011001 |
3 | 202120010021101210000201 |
4 | 3020102321031003121 |
5 | 12010423212202421 |
6 | 242444420502201 |
7 | 21352343213161 |
oct | 3102271150331 |
9 | 676107353021 |
10 | 215065350361 |
11 | 83232868984 |
12 | 35820b4a961 |
13 | 17385569584 |
14 | a5a2c775a1 |
15 | 58dad96b91 |
hex | 3212e4d0d9 |
215065350361 has 4 divisors (see below), whose sum is σ = 224416017792. Its totient is φ = 205714682932.
The previous prime is 215065350329. The next prime is 215065350397. The reversal of 215065350361 is 163053560512.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 215065350361 - 25 = 215065350329 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 215065350361.
It is not an unprimeable number, because it can be changed into a prime (215065356361) 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 3 ways as a sum of consecutive naturals, for example, 4675333681 + ... + 4675333726.
It is an arithmetic number, because the mean of its divisors is an integer number (56104004448).
Almost surely, 2215065350361 is an apocalyptic number.
It is an amenable number.
215065350361 is a deficient number, since it is larger than the sum of its proper divisors (9350667431).
215065350361 is an equidigital number, since it uses as much as digits as its factorization.
215065350361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9350667430.
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 215065350361 in words is "two hundred fifteen billion, sixty-five million, three hundred fifty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •