Base | Representation |
---|---|
bin | 1011111000000010011… |
… | …1100011001111100011 |
3 | 201111121121002121222122 |
4 | 2332000213203033203 |
5 | 11320313424031111 |
6 | 233420500454455 |
7 | 20511560363036 |
oct | 2760047431743 |
9 | 644547077878 |
10 | 204021314531 |
11 | 79585793341 |
12 | 3365a3aa42b |
13 | 16315494428 |
14 | 9c361c301d |
15 | 5491509cdb |
hex | 2f809e33e3 |
204021314531 has 4 divisors (see below), whose sum is σ = 204124723152. Its totient is φ = 203917905912.
The previous prime is 204021314521. The next prime is 204021314573. The reversal of 204021314531 is 135413120402.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 204021314531 - 26 = 204021314467 is a prime.
It is a super-2 number, since 2×2040213145312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204021314531.
It is not an unprimeable number, because it can be changed into a prime (204021314521) 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, 51701351 + ... + 51705296.
It is an arithmetic number, because the mean of its divisors is an integer number (51031180788).
Almost surely, 2204021314531 is an apocalyptic number.
204021314531 is a deficient number, since it is larger than the sum of its proper divisors (103408621).
204021314531 is a wasteful number, since it uses less digits than its factorization.
204021314531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103408620.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 204021314531 its reverse (135413120402), we get a palindrome (339434434933).
The spelling of 204021314531 in words is "two hundred four billion, twenty-one million, three hundred fourteen thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •