Base | Representation |
---|---|
bin | 110000100100101011… |
… | …1111000001010001011 |
3 | 100222020120001202110222 |
4 | 1201021113320022023 |
5 | 3202111403224321 |
6 | 115530333500255 |
7 | 10351622110643 |
oct | 1411127701213 |
9 | 328216052428 |
10 | 104310211211 |
11 | 40268438628 |
12 | 1827134168b |
13 | 9ab479598b |
14 | 5097685523 |
15 | 2aa78393ab |
hex | 18495f828b |
104310211211 has 8 divisors (see below), whose sum is σ = 105084169344. Its totient is φ = 103536435520.
The previous prime is 104310211207. The next prime is 104310211237. The reversal of 104310211211 is 112112013401.
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 104310211211 - 22 = 104310211207 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 104310211211.
It is not an unprimeable number, because it can be changed into a prime (104310511211) 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 7 ways as a sum of consecutive naturals, for example, 1234721 + ... + 1316493.
It is an arithmetic number, because the mean of its divisors is an integer number (13135521168).
Almost surely, 2104310211211 is an apocalyptic number.
104310211211 is a deficient number, since it is larger than the sum of its proper divisors (773958133).
104310211211 is an equidigital number, since it uses as much as digits as its factorization.
104310211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91221.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 104310211211 its reverse (112112013401), we get a palindrome (216422224612).
The spelling of 104310211211 in words is "one hundred four billion, three hundred ten million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •