Base | Representation |
---|---|
bin | 1100011101010101010… |
… | …1001101001000010001 |
3 | 202110110021220201020100 |
4 | 3013111111031020101 |
5 | 12001314310101223 |
6 | 242154123203013 |
7 | 21314632155246 |
oct | 3072525151021 |
9 | 673407821210 |
10 | 214032503313 |
11 | 8285284a682 |
12 | 35593076469 |
13 | 1724c59b585 |
14 | a505a195cd |
15 | 587a378043 |
hex | 31d554d211 |
214032503313 has 6 divisors (see below), whose sum is σ = 309158060354. Its totient is φ = 142688335536.
The previous prime is 214032503309. The next prime is 214032503339. The reversal of 214032503313 is 313305230412.
214032503313 is a `hidden beast` number, since 2 + 1 + 4 + 0 + 325 + 0 + 331 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 191623311504 + 22409191809 = 437748^2 + 149697^2 .
It is not a de Polignac number, because 214032503313 - 22 = 214032503309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214032503353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11890694620 + ... + 11890694637.
Almost surely, 2214032503313 is an apocalyptic number.
It is an amenable number.
214032503313 is a deficient number, since it is larger than the sum of its proper divisors (95125557041).
214032503313 is a wasteful number, since it uses less digits than its factorization.
214032503313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23781389263 (or 23781389260 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 214032503313 its reverse (313305230412), we get a palindrome (527337733725).
The spelling of 214032503313 in words is "two hundred fourteen billion, thirty-two million, five hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •