Base | Representation |
---|---|
bin | 1100011010101001110… |
… | …1000011100110000010 |
3 | 202101121011022022211020 |
4 | 3012222131003212002 |
5 | 11443331131003442 |
6 | 241554504530310 |
7 | 21261045532344 |
oct | 3065235034602 |
9 | 671534268736 |
10 | 213313141122 |
11 | 82513786174 |
12 | 35412180996 |
13 | 17166540183 |
14 | a478281294 |
15 | 583712d9ec |
hex | 31aa743982 |
213313141122 has 8 divisors (see below), whose sum is σ = 426626282256. Its totient is φ = 71104380372.
The previous prime is 213313141109. The next prime is 213313141123. The reversal of 213313141122 is 221141313312.
It is a sphenic number, since it is the product of 3 distinct primes.
213313141122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 213313141092 and 213313141101.
It is not an unprimeable number, because it can be changed into a prime (213313141123) 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 in 3 ways as a sum of consecutive naturals, for example, 17776095088 + ... + 17776095099.
It is an arithmetic number, because the mean of its divisors is an integer number (53328285282).
Almost surely, 2213313141122 is an apocalyptic number.
213313141122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213313141122 is a wasteful number, since it uses less digits than its factorization.
213313141122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35552190192.
The product of its digits is 864, while the sum is 24.
Adding to 213313141122 its reverse (221141313312), we get a palindrome (434454454434).
The spelling of 213313141122 in words is "two hundred thirteen billion, three hundred thirteen million, one hundred forty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •