Base | Representation |
---|---|
bin | 1100001111100000010… |
… | …1010011101011000010 |
3 | 202002212121021000110112 |
4 | 3003320011103223002 |
5 | 11421214031233244 |
6 | 240341523431322 |
7 | 21123640233335 |
oct | 3037005235302 |
9 | 662777230415 |
10 | 210320571074 |
11 | 8121852aa89 |
12 | 34917b25542 |
13 | 16aaa55a773 |
14 | a272a5061c |
15 | 570e55639e |
hex | 30f8153ac2 |
210320571074 has 4 divisors (see below), whose sum is σ = 315480856614. Its totient is φ = 105160285536.
The previous prime is 210320571073. The next prime is 210320571077. The reversal of 210320571074 is 470175023012.
210320571074 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 127908515449 + 82412055625 = 357643^2 + 287075^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 210320571074.
It is not an unprimeable number, because it can be changed into a prime (210320571073) by changing a digit.
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 as a sum of consecutive naturals, namely, 52580142767 + ... + 52580142770.
Almost surely, 2210320571074 is an apocalyptic number.
210320571074 is a deficient number, since it is larger than the sum of its proper divisors (105160285540).
210320571074 is a wasteful number, since it uses less digits than its factorization.
210320571074 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105160285539.
The product of its (nonzero) digits is 11760, while the sum is 32.
Adding to 210320571074 its reverse (470175023012), we get a palindrome (680495594086).
The spelling of 210320571074 in words is "two hundred ten billion, three hundred twenty million, five hundred seventy-one thousand, seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •