Base | Representation |
---|---|
bin | 110001011101011000… |
… | …0010001100100011001 |
3 | 101011011010102121001110 |
4 | 1202322300101210121 |
5 | 3220010340312103 |
6 | 120443205010533 |
7 | 10450020530412 |
oct | 1427260214431 |
9 | 334133377043 |
10 | 106212432153 |
11 | 41054170353 |
12 | 187023b3a49 |
13 | a0288c63b9 |
14 | 51d816a809 |
15 | 2b69835403 |
hex | 18bac11919 |
106212432153 has 8 divisors (see below), whose sum is σ = 141637328928. Its totient is φ = 70797911744.
The previous prime is 106212432031. The next prime is 106212432187. The reversal of 106212432153 is 351234212601.
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 106212432153 - 214 = 106212415769 is a prime.
It is a super-2 number, since 2×1062124321532 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106212432153.
It is not an unprimeable number, because it can be changed into a prime (106212432253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2570175 + ... + 2611172.
It is an arithmetic number, because the mean of its divisors is an integer number (17704666116).
Almost surely, 2106212432153 is an apocalyptic number.
It is an amenable number.
106212432153 is a deficient number, since it is larger than the sum of its proper divisors (35424896775).
106212432153 is an equidigital number, since it uses as much as digits as its factorization.
106212432153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5188183.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 106212432153 its reverse (351234212601), we get a palindrome (457446644754).
The spelling of 106212432153 in words is "one hundred six billion, two hundred twelve million, four hundred thirty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •