Base | Representation |
---|---|
bin | 110001001001001111… |
… | …0011010011011110010 |
3 | 101002102000211212121220 |
4 | 1202102132122123302 |
5 | 3212114341124414 |
6 | 120252144525510 |
7 | 10424203550664 |
oct | 1422236323362 |
9 | 332360755556 |
10 | 105536661234 |
11 | 4083776a694 |
12 | 18554020896 |
13 | 9c4b8bb354 |
14 | 51724dc534 |
15 | 2b2a34bca9 |
hex | 189279a6f2 |
105536661234 has 8 divisors (see below), whose sum is σ = 211073322480. Its totient is φ = 35178887076.
The previous prime is 105536661221. The next prime is 105536661271. The reversal of 105536661234 is 432166635501.
105536661234 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
105536661234 is an admirable number.
It is a super-2 number, since 2×1055366612342 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8794721764 + ... + 8794721775.
It is an arithmetic number, because the mean of its divisors is an integer number (26384165310).
Almost surely, 2105536661234 is an apocalyptic number.
105536661234 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105536661234 is a wasteful number, since it uses less digits than its factorization.
105536661234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17589443544.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 105536661234 in words is "one hundred five billion, five hundred thirty-six million, six hundred sixty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •