Base | Representation |
---|---|
bin | 110000111100111110… |
… | …1010101000100100110 |
3 | 101001100100212100120022 |
4 | 1201321331111010212 |
5 | 3210244041212314 |
6 | 120143252435142 |
7 | 10411050415055 |
oct | 1417175250446 |
9 | 331310770508 |
10 | 105125335334 |
11 | 40646569428 |
12 | 1845a318ab2 |
13 | 9bb4612846 |
14 | 5133a2a39c |
15 | 2b0419c78e |
hex | 1879f55126 |
105125335334 has 8 divisors (see below), whose sum is σ = 165987371640. Its totient is φ = 49796211456.
The previous prime is 105125335331. The next prime is 105125335409. The reversal of 105125335334 is 433533521501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1051253353342 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105125335294 and 105125335303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105125335331) by changing a digit.
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, 1383228059 + ... + 1383228134.
It is an arithmetic number, because the mean of its divisors is an integer number (20748421455).
Almost surely, 2105125335334 is an apocalyptic number.
105125335334 is a deficient number, since it is larger than the sum of its proper divisors (60862036306).
105125335334 is a wasteful number, since it uses less digits than its factorization.
105125335334 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766456214.
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 105125335334 its reverse (433533521501), we get a palindrome (538658856835).
The spelling of 105125335334 in words is "one hundred five billion, one hundred twenty-five million, three hundred thirty-five thousand, three hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •