Base | Representation |
---|---|
bin | 1100011101010011010… |
… | …1010011111000010001 |
3 | 202110102201011221011011 |
4 | 3013110311103320101 |
5 | 12001310140023403 |
6 | 242153224050521 |
7 | 21314501123260 |
oct | 3072465237021 |
9 | 673381157134 |
10 | 214024142353 |
11 | 8284905999a |
12 | 35590303a41 |
13 | 1724a931a68 |
14 | a5048805d7 |
15 | 5879775a6d |
hex | 31d4d53e11 |
214024142353 has 8 divisors (see below), whose sum is σ = 250564849920. Its totient is φ = 178974892320.
The previous prime is 214024142347. The next prime is 214024142357. The reversal of 214024142353 is 353241420412.
214024142353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 214024142353 - 237 = 76585188881 is a prime.
It is not an unprimeable number, because it can be changed into a prime (214024142357) 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, 372864073 + ... + 372864646.
It is an arithmetic number, because the mean of its divisors is an integer number (31320606240).
Almost surely, 2214024142353 is an apocalyptic number.
It is an amenable number.
214024142353 is a deficient number, since it is larger than the sum of its proper divisors (36540707567).
214024142353 is an equidigital number, since it uses as much as digits as its factorization.
214024142353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745728767.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 214024142353 its reverse (353241420412), we get a palindrome (567265562765).
The spelling of 214024142353 in words is "two hundred fourteen billion, twenty-four million, one hundred forty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •