Base | Representation |
---|---|
bin | 1100001111001000101… |
… | …0010110110010001010 |
3 | 202002121200100000211111 |
4 | 3003302022112302022 |
5 | 11421013113344432 |
6 | 240324014320534 |
7 | 21121322661001 |
oct | 3036212266212 |
9 | 662550300744 |
10 | 210221231242 |
11 | 8117744a550 |
12 | 348aa7b914a |
13 | 16a92ab85b9 |
14 | a263791c38 |
15 | 5705982347 |
hex | 30f2296c8a |
210221231242 has 8 divisors (see below), whose sum is σ = 343998378432. Its totient is φ = 95555105100.
The previous prime is 210221231219. The next prime is 210221231257. The reversal of 210221231242 is 242132122012.
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: 9555510511 = 210221231242 / (2 + 1 + 0 + 2 + 2 + 1 + 2 + 3 + 1 + 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, 4777755234 + ... + 4777755277.
It is an arithmetic number, because the mean of its divisors is an integer number (42999797304).
Almost surely, 2210221231242 is an apocalyptic number.
210221231242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
210221231242 is a deficient number, since it is larger than the sum of its proper divisors (133777147190).
210221231242 is a wasteful number, since it uses less digits than its factorization.
210221231242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9555510524.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 210221231242 its reverse (242132122012), we get a palindrome (452353353254).
The spelling of 210221231242 in words is "two hundred ten billion, two hundred twenty-one million, two hundred thirty-one thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •