Base | Representation |
---|---|
bin | 1100011101010100111… |
… | …1100101110100010101 |
3 | 202110110012010221101110 |
4 | 3013111033211310111 |
5 | 12001313421002243 |
6 | 242154031445233 |
7 | 21314613515412 |
oct | 3072517456425 |
9 | 673405127343 |
10 | 214031031573 |
11 | 82851a34967 |
12 | 35592686819 |
13 | 1724c1a4718 |
14 | a505755109 |
15 | 587a186e33 |
hex | 31d53e5d15 |
214031031573 has 8 divisors (see below), whose sum is σ = 286968981600. Its totient is φ = 141890217968.
The previous prime is 214031031569. The next prime is 214031031601. The reversal of 214031031573 is 375130130412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 214031031573 - 22 = 214031031569 is a prime.
It is a super-3 number, since 3×2140310315733 (a number of 35 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 214031031573.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214031031553) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199283478 + ... + 199284551.
It is an arithmetic number, because the mean of its divisors is an integer number (35871122700).
Almost surely, 2214031031573 is an apocalyptic number.
It is an amenable number.
214031031573 is a deficient number, since it is larger than the sum of its proper divisors (72937950027).
214031031573 is a wasteful number, since it uses less digits than its factorization.
214031031573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398568211.
The product of its (nonzero) digits is 7560, while the sum is 30.
Adding to 214031031573 its reverse (375130130412), we get a palindrome (589161161985).
The spelling of 214031031573 in words is "two hundred fourteen billion, thirty-one million, thirty-one thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •