Base | Representation |
---|---|
bin | 11011000101111100… |
… | …00010001101100011 |
3 | 1101112200121101010120 |
4 | 31202332002031203 |
5 | 214242101043133 |
6 | 10403152531323 |
7 | 1023306162645 |
oct | 154276021543 |
9 | 41480541116 |
10 | 14545331043 |
11 | 6194507551 |
12 | 299b250b43 |
13 | 14aa5a6179 |
14 | 9bdaac895 |
15 | 5a1e52ab3 |
hex | 362f82363 |
14545331043 has 8 divisors (see below), whose sum is σ = 19394495568. Its totient is φ = 9696526944.
The previous prime is 14545331039. The next prime is 14545331081. The reversal of 14545331043 is 34013354541.
14545331043 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 14545331043 - 22 = 14545331039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14545330995 and 14545331013.
It is not an unprimeable number, because it can be changed into a prime (14545331023) 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 7 ways as a sum of consecutive naturals, for example, 25105 + ... + 172397.
It is an arithmetic number, because the mean of its divisors is an integer number (2424311946).
Almost surely, 214545331043 is an apocalyptic number.
14545331043 is a deficient number, since it is larger than the sum of its proper divisors (4849164525).
14545331043 is a wasteful number, since it uses less digits than its factorization.
14545331043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180213.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 14545331043 its reverse (34013354541), we get a palindrome (48558685584).
The spelling of 14545331043 in words is "fourteen billion, five hundred forty-five million, three hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •