Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …1000010111101011010 |
3 | 202021110202101200010211 |
4 | 3011202101002331122 |
5 | 11433341110030432 |
6 | 241234402401334 |
7 | 21216041351521 |
oct | 3054221027532 |
9 | 667422350124 |
10 | 212102033242 |
11 | 81a52082970 |
12 | 3513466024a |
13 | 17002659aa8 |
14 | a3a149d4b8 |
15 | 57b5b4bd47 |
hex | 3162442f5a |
212102033242 has 8 divisors (see below), whose sum is σ = 347076054432. Its totient is φ = 96410015100.
The previous prime is 212102033239. The next prime is 212102033267. The reversal of 212102033242 is 242330201212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 9641001511 = 212102033242 / (2 + 1 + 2 + 1 + 0 + 2 + 0 + 3 + 3 + 2 + 4 + 2).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4820500734 + ... + 4820500777.
It is an arithmetic number, because the mean of its divisors is an integer number (43384506804).
Almost surely, 2212102033242 is an apocalyptic number.
212102033242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
212102033242 is a deficient number, since it is larger than the sum of its proper divisors (134974021190).
212102033242 is a wasteful number, since it uses less digits than its factorization.
212102033242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9641001524.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 212102033242 its reverse (242330201212), we get a palindrome (454432234454).
The spelling of 212102033242 in words is "two hundred twelve billion, one hundred two million, thirty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •