Base | Representation |
---|---|
bin | 11010011110100100… |
… | …00101100011110001 |
3 | 1100200200010000112200 |
4 | 31033102011203301 |
5 | 213103022341223 |
6 | 10310313413413 |
7 | 1012155605652 |
oct | 151722054361 |
9 | 40620100480 |
10 | 14215043313 |
11 | 6035026489 |
12 | 290870a269 |
13 | 1457032443 |
14 | 98bc93529 |
15 | 582e5ea43 |
hex | 34f4858f1 |
14215043313 has 12 divisors (see below), whose sum is σ = 20533934928. Its totient is φ = 9476190360.
The previous prime is 14215043261. The next prime is 14215043321. The reversal of 14215043313 is 31334051241.
It is a happy number.
14215043313 is a `hidden beast` number, since 1 + 4 + 215 + 0 + 433 + 13 = 666.
14215043313 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 14215043313 - 212 = 14215039217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14215023313) 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 11 ways as a sum of consecutive naturals, for example, 225906 + ... + 281892.
It is an arithmetic number, because the mean of its divisors is an integer number (1711161244).
Almost surely, 214215043313 is an apocalyptic number.
It is an amenable number.
14215043313 is a deficient number, since it is larger than the sum of its proper divisors (6318891615).
14215043313 is a wasteful number, since it uses less digits than its factorization.
14215043313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84204 (or 84201 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 14215043313 its reverse (31334051241), we get a palindrome (45549094554).
The spelling of 14215043313 in words is "fourteen billion, two hundred fifteen million, forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •