Base | Representation |
---|---|
bin | 1011101100111100101… |
… | …1001001100110000010 |
3 | 201012221010022201211001 |
4 | 2323033023021212002 |
5 | 11243214320132320 |
6 | 232205233042214 |
7 | 20345031241603 |
oct | 2731713114602 |
9 | 635833281731 |
10 | 201044302210 |
11 | 782982a3984 |
12 | 32b693b636a |
13 | 15c5c79b18b |
14 | 9a32a81daa |
15 | 5369ea720a |
hex | 2ecf2c9982 |
201044302210 has 8 divisors (see below), whose sum is σ = 361879743996. Its totient is φ = 80417720880.
The previous prime is 201044302171. The next prime is 201044302219. The reversal of 201044302210 is 12203440102.
201044302210 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 184692798081 + 16351504129 = 429759^2 + 127873^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2010443022102 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201044302219) 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 3 ways as a sum of consecutive naturals, for example, 10052215101 + ... + 10052215120.
Almost surely, 2201044302210 is an apocalyptic number.
201044302210 is a deficient number, since it is larger than the sum of its proper divisors (160835441786).
201044302210 is a wasteful number, since it uses less digits than its factorization.
201044302210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20104430228.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 201044302210 its reverse (12203440102), we get a palindrome (213247742312).
The spelling of 201044302210 in words is "two hundred one billion, forty-four million, three hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •