Base | Representation |
---|---|
bin | 1100100000011000111… |
… | …1011001001011001111 |
3 | 202112120110221111000202 |
4 | 3020012033121023033 |
5 | 12010004341012000 |
6 | 242411354444115 |
7 | 21344154622526 |
oct | 3100617311317 |
9 | 675513844022 |
10 | 214853063375 |
11 | 83133a53595 |
12 | 35781a3363b |
13 | 1735059c782 |
14 | a5829b74bd |
15 | 58c7411dd5 |
hex | 32063d92cf |
214853063375 has 16 divisors (see below), whose sum is σ = 271367197920. Its totient is φ = 169811569600.
The previous prime is 214853063371. The next prime is 214853063401. The reversal of 214853063375 is 573360358412.
214853063375 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 214853063375 - 22 = 214853063371 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (214853063371) 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 15 ways as a sum of consecutive naturals, for example, 10343990 + ... + 10364739.
It is an arithmetic number, because the mean of its divisors is an integer number (16960449870).
Almost surely, 2214853063375 is an apocalyptic number.
214853063375 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
214853063375 is a deficient number, since it is larger than the sum of its proper divisors (56514134545).
214853063375 is an equidigital number, since it uses as much as digits as its factorization.
214853063375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20708827 (or 20708817 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 214853063375 in words is "two hundred fourteen billion, eight hundred fifty-three million, sixty-three thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •