Base | Representation |
---|---|
bin | 1100010110111110111… |
… | …1000101011111010111 |
3 | 202022001111121120100122 |
4 | 3011233233011133113 |
5 | 11434321432333420 |
6 | 241313034102155 |
7 | 21224454215120 |
oct | 3055757053727 |
9 | 668044546318 |
10 | 212328011735 |
11 | 82058699954 |
12 | 3519827a95b |
13 | 1703a40b788 |
14 | a3c34c5047 |
15 | 57ca8d8725 |
hex | 316fbc57d7 |
212328011735 has 8 divisors (see below), whose sum is σ = 291192701856. Its totient is φ = 145596350880.
The previous prime is 212328011719. The next prime is 212328011741. The reversal of 212328011735 is 537110823212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212328011735 - 24 = 212328011719 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 6066514621 = 212328011735 / (2 + 1 + 2 + 3 + 2 + 8 + 0 + 1 + 1 + 7 + 3 + 5).
It is a junction number, because it is equal to n+sod(n) for n = 212328011695 and 212328011704.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3033257276 + ... + 3033257345.
It is an arithmetic number, because the mean of its divisors is an integer number (36399087732).
Almost surely, 2212328011735 is an apocalyptic number.
212328011735 is a deficient number, since it is larger than the sum of its proper divisors (78864690121).
212328011735 is an equidigital number, since it uses as much as digits as its factorization.
212328011735 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6066514633.
The product of its (nonzero) digits is 20160, while the sum is 35.
Adding to 212328011735 its reverse (537110823212), we get a palindrome (749438834947).
The spelling of 212328011735 in words is "two hundred twelve billion, three hundred twenty-eight million, eleven thousand, seven hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •