Base | Representation |
---|---|
bin | 11010100011110011… |
… | …01100010101110101 |
3 | 1100210201210020122021 |
4 | 31101321230111311 |
5 | 213200244331323 |
6 | 10314523233141 |
7 | 1013231221612 |
oct | 152171542565 |
9 | 40721706567 |
10 | 14258980213 |
11 | 6057905975 |
12 | 291b3787b1 |
13 | 1463176bca |
14 | 993a4d509 |
15 | 586c3d05d |
hex | 351e6c575 |
14258980213 has 8 divisors (see below), whose sum is σ = 14651136896. Its totient is φ = 13869576000.
The previous prime is 14258980189. The next prime is 14258980301. The reversal of 14258980213 is 31208985241.
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 14258980213 - 221 = 14256883061 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
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 14258980213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14258980313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677613 + ... + 698338.
It is an arithmetic number, because the mean of its divisors is an integer number (1831392112).
Almost surely, 214258980213 is an apocalyptic number.
It is an amenable number.
14258980213 is a deficient number, since it is larger than the sum of its proper divisors (392156683).
14258980213 is a wasteful number, since it uses less digits than its factorization.
14258980213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376235.
The product of its (nonzero) digits is 138240, while the sum is 43.
The spelling of 14258980213 in words is "fourteen billion, two hundred fifty-eight million, nine hundred eighty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •