Base | Representation |
---|---|
bin | 110001000001000001… |
… | …0001000111110000011 |
3 | 101001200210210101122111 |
4 | 1202002002020332003 |
5 | 3211033232023321 |
6 | 120204532320151 |
7 | 10414314105160 |
oct | 1420202107603 |
9 | 331623711574 |
10 | 105260814211 |
11 | 40705a92743 |
12 | 18497773057 |
13 | 9c066c9067 |
14 | 5147a15067 |
15 | 2b1100e5e1 |
hex | 1882088f83 |
105260814211 has 8 divisors (see below), whose sum is σ = 120303650304. Its totient is φ = 90219372360.
The previous prime is 105260814199. The next prime is 105260814229. The reversal of 105260814211 is 112418062501.
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 105260814211 - 217 = 105260683139 is a prime.
It is a super-2 number, since 2×1052608142112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105260874211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 181435 + ... + 493396.
It is an arithmetic number, because the mean of its divisors is an integer number (15037956288).
Almost surely, 2105260814211 is an apocalyptic number.
105260814211 is a deficient number, since it is larger than the sum of its proper divisors (15042836093).
105260814211 is an equidigital number, since it uses as much as digits as its factorization.
105260814211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697121.
The product of its (nonzero) digits is 3840, while the sum is 31.
Adding to 105260814211 its reverse (112418062501), we get a palindrome (217678876712).
The spelling of 105260814211 in words is "one hundred five billion, two hundred sixty million, eight hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •