Base | Representation |
---|---|
bin | 11010000101011110… |
… | …01000111100001011 |
3 | 1100011000001010120220 |
4 | 31002233020330023 |
5 | 212140131234111 |
6 | 10233354121123 |
7 | 1004021520651 |
oct | 150257107413 |
9 | 40130033526 |
10 | 14004555531 |
11 | 5a3722a93a |
12 | 286a1201a3 |
13 | 1422545565 |
14 | 96bd40dd1 |
15 | 56e732e06 |
hex | 342bc8f0b |
14004555531 has 8 divisors (see below), whose sum is σ = 18935737344. Its totient is φ = 9204872040.
The previous prime is 14004555529. The next prime is 14004555547. The reversal of 14004555531 is 13555540041.
14004555531 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 14004555531 - 21 = 14004555529 is a prime.
It is a super-2 number, since 2×140045555312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14004555492 and 14004555501.
It is not an unprimeable number, because it can be changed into a prime (14004555581) 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, 32874331 + ... + 32874756.
It is an arithmetic number, because the mean of its divisors is an integer number (2366967168).
Almost surely, 214004555531 is an apocalyptic number.
14004555531 is a deficient number, since it is larger than the sum of its proper divisors (4931181813).
14004555531 is an equidigital number, since it uses as much as digits as its factorization.
14004555531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65749161.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 14004555531 in words is "fourteen billion, four million, five hundred fifty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •