Base | Representation |
---|---|
bin | 1100010111010101001… |
… | …1000000011100011101 |
3 | 202022022000011211110102 |
4 | 3011311103000130131 |
5 | 11440014324024313 |
6 | 241330205550445 |
7 | 21226666244264 |
oct | 3056523003435 |
9 | 668260154412 |
10 | 212421314333 |
11 | 820a6326538 |
12 | 35203575425 |
13 | 17053848a07 |
14 | a3d1a515db |
15 | 57d3bb8a58 |
hex | 31754c071d |
212421314333 has 4 divisors (see below), whose sum is σ = 213171919968. Its totient is φ = 211670708700.
The previous prime is 212421314309. The next prime is 212421314341. The reversal of 212421314333 is 333413124212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212421314333 - 210 = 212421313309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212421314296 and 212421314305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212421314033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 375302393 + ... + 375302958.
It is an arithmetic number, because the mean of its divisors is an integer number (53292979992).
Almost surely, 2212421314333 is an apocalyptic number.
It is an amenable number.
212421314333 is a deficient number, since it is larger than the sum of its proper divisors (750605635).
212421314333 is an equidigital number, since it uses as much as digits as its factorization.
212421314333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750605634.
The product of its digits is 10368, while the sum is 29.
Adding to 212421314333 its reverse (333413124212), we get a palindrome (545834438545).
The spelling of 212421314333 in words is "two hundred twelve billion, four hundred twenty-one million, three hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •