Base | Representation |
---|---|
bin | 110000011110110000101101… |
… | …101100101001100111001010 |
3 | 1000221221122101222121210101122 |
4 | 300132300231230221213022 |
5 | 210421344303004401442 |
6 | 2033251550004315242 |
7 | 62624434263623564 |
oct | 6036605554514712 |
9 | 1027848358553348 |
10 | 213220123122122 |
11 | 61a36167957786 |
12 | 1bab75a39a2b22 |
13 | 91c87572bc0cc |
14 | 3a91ca2502334 |
15 | 199b528636dd2 |
hex | c1ec2db299ca |
213220123122122 has 8 divisors (see below), whose sum is σ = 319913192788356. Its totient is φ = 106582392192672.
The previous prime is 213220123122119. The next prime is 213220123122151. The reversal of 213220123122122 is 221221321022312.
213220123122122 is digitally balanced in base 2, because in such base 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 150575256769921 + 62644866352201 = 12270911^2 + 7914851^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 213220123122091 and 213220123122100.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13834674563 + ... + 13834689974.
Almost surely, 2213220123122122 is an apocalyptic number.
213220123122122 is a deficient number, since it is larger than the sum of its proper divisors (106693069666234).
213220123122122 is a wasteful number, since it uses less digits than its factorization.
213220123122122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27669368392.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 213220123122122 its reverse (221221321022312), we get a palindrome (434441444144434).
The spelling of 213220123122122 in words is "two hundred thirteen trillion, two hundred twenty billion, one hundred twenty-three million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •