Base | Representation |
---|---|
bin | 11000001010000001111101… |
… | …101111000101101110111001 |
3 | 111221011200020221211222020222 |
4 | 120022001331233011232321 |
5 | 102411133434123430410 |
6 | 1013543032203025425 |
7 | 31243522136152346 |
oct | 3012017557055671 |
9 | 457150227758228 |
10 | 106242420530105 |
11 | 30941180722972 |
12 | baba5ab80b275 |
13 | 47388041a08a2 |
14 | 1c342369357cd |
15 | c43920e42955 |
hex | 60a07dbc5bb9 |
106242420530105 has 8 divisors (see below), whose sum is σ = 127491195092352. Its totient is φ = 84993742786608.
The previous prime is 106242420530087. The next prime is 106242420530137. The reversal of 106242420530105 is 501035024242601.
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 106242420530105 - 210 = 106242420529081 is a prime.
It is a super-2 number, since 2×1062424205301052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21768257 + ... + 26198126.
It is an arithmetic number, because the mean of its divisors is an integer number (15936399386544).
Almost surely, 2106242420530105 is an apocalyptic number.
It is an amenable number.
106242420530105 is a deficient number, since it is larger than the sum of its proper divisors (21248774562247).
106242420530105 is an equidigital number, since it uses as much as digits as its factorization.
106242420530105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48409375.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 106242420530105 its reverse (501035024242601), we get a palindrome (607277444772706).
The spelling of 106242420530105 in words is "one hundred six trillion, two hundred forty-two billion, four hundred twenty million, five hundred thirty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •