Base | Representation |
---|---|
bin | 101111110001101011101001… |
… | …001000010101001110001001 |
3 | 1000112222111101110101121121021 |
4 | 233301223221020111032021 |
5 | 210020120433120032223 |
6 | 2022520504100312441 |
7 | 62154556336066261 |
oct | 5761535110251611 |
9 | 1015874343347537 |
10 | 210122301330313 |
11 | 60a51405250a69 |
12 | 1b6971396a2721 |
13 | 90325a9321278 |
14 | 39c5d8b9927a1 |
15 | 1945b6b01d65d |
hex | bf1ae9215389 |
210122301330313 has 32 divisors (see below), whose sum is σ = 218016446054400. Its totient is φ = 202272609139776.
The previous prime is 210122301330299. The next prime is 210122301330317. The reversal of 210122301330313 is 313033103221012.
210122301330313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 210122301330313 - 25 = 210122301330281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210122301330317) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42509061120 + ... + 42509066062.
It is an arithmetic number, because the mean of its divisors is an integer number (6813013939200).
Almost surely, 2210122301330313 is an apocalyptic number.
It is an amenable number.
210122301330313 is a deficient number, since it is larger than the sum of its proper divisors (7894144724087).
210122301330313 is a wasteful number, since it uses less digits than its factorization.
210122301330313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8541.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 210122301330313 its reverse (313033103221012), we get a palindrome (523155404551325).
The spelling of 210122301330313 in words is "two hundred ten trillion, one hundred twenty-two billion, three hundred one million, three hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •