Base | Representation |
---|---|
bin | 1100011101010011010… |
… | …0111000011110110101 |
3 | 202110102200222020012212 |
4 | 3013110310320132311 |
5 | 12001310122431013 |
6 | 242153221423205 |
7 | 21314500145144 |
oct | 3072464703665 |
9 | 673380866185 |
10 | 214024030133 |
11 | 82848a92651 |
12 | 3559026ab05 |
13 | 1724a8c2964 |
14 | a50485175b |
15 | 58797526a8 |
hex | 31d4d387b5 |
214024030133 has 4 divisors (see below), whose sum is σ = 215441407968. Its totient is φ = 212606652300.
The previous prime is 214024030111. The next prime is 214024030147. The reversal of 214024030133 is 331030420412.
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 214024030133 - 216 = 214023964597 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 214024030099 and 214024030108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214024035133) 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, 708688691 + ... + 708688992.
It is an arithmetic number, because the mean of its divisors is an integer number (53860351992).
Almost surely, 2214024030133 is an apocalyptic number.
It is an amenable number.
214024030133 is a deficient number, since it is larger than the sum of its proper divisors (1417377835).
214024030133 is a wasteful number, since it uses less digits than its factorization.
214024030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1417377834.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 214024030133 its reverse (331030420412), we get a palindrome (545054450545).
The spelling of 214024030133 in words is "two hundred fourteen billion, twenty-four million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •