Base | Representation |
---|---|
bin | 110000111111010001… |
… | …1000011000101110101 |
3 | 101001112201202012011110 |
4 | 1201332203003011311 |
5 | 3210423244111041 |
6 | 120155043025233 |
7 | 10413004032153 |
oct | 1417643030565 |
9 | 331481665143 |
10 | 105202332021 |
11 | 40685a79156 |
12 | 1848006b219 |
13 | 9bc7560c07 |
14 | 513dd503d3 |
15 | 2b0ad0b516 |
hex | 187e8c3175 |
105202332021 has 8 divisors (see below), whose sum is σ = 140803122240. Its totient is φ = 69868214912.
The previous prime is 105202332019. The next prime is 105202332029. The reversal of 105202332021 is 120233202501.
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 105202332021 - 21 = 105202332019 is a prime.
It is a super-2 number, since 2×1052023320212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105202332029) 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 7 ways as a sum of consecutive naturals, for example, 66667356 + ... + 66668933.
It is an arithmetic number, because the mean of its divisors is an integer number (17600390280).
Almost surely, 2105202332021 is an apocalyptic number.
It is an amenable number.
105202332021 is a deficient number, since it is larger than the sum of its proper divisors (35600790219).
105202332021 is a wasteful number, since it uses less digits than its factorization.
105202332021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133336555.
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 105202332021 its reverse (120233202501), we get a palindrome (225435534522).
The spelling of 105202332021 in words is "one hundred five billion, two hundred two million, three hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •