Base | Representation |
---|---|
bin | 110001000000001110… |
… | …0010100110010111001 |
3 | 101001121221120101111201 |
4 | 1202000130110302321 |
5 | 3211004413431321 |
6 | 120202140254201 |
7 | 10413541203061 |
oct | 1420034246271 |
9 | 331557511451 |
10 | 105234123961 |
11 | 406a1a1298a |
12 | 1848a841361 |
13 | 9c01012705 |
14 | 51442683a1 |
15 | 2b0d9db291 |
hex | 1880714cb9 |
105234123961 has 4 divisors (see below), whose sum is σ = 105263596624. Its totient is φ = 105204651300.
The previous prime is 105234123959. The next prime is 105234123971. The reversal of 105234123961 is 169321432501.
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 105234123961 - 21 = 105234123959 is a prime.
It is a super-2 number, since 2×1052341239612 (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 105234123961.
It is not an unprimeable number, because it can be changed into a prime (105234123931) 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, 14730975 + ... + 14738116.
It is an arithmetic number, because the mean of its divisors is an integer number (26315899156).
Almost surely, 2105234123961 is an apocalyptic number.
It is an amenable number.
105234123961 is a deficient number, since it is larger than the sum of its proper divisors (29472663).
105234123961 is an equidigital number, since it uses as much as digits as its factorization.
105234123961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29472662.
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 105234123961 in words is "one hundred five billion, two hundred thirty-four million, one hundred twenty-three thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •