Base | Representation |
---|---|
bin | 11010101100010001… |
… | …00111111110001101 |
3 | 1100222200102121001111 |
4 | 31112020213332031 |
5 | 213321440101331 |
6 | 10325541412021 |
7 | 1015053006253 |
oct | 152610477615 |
9 | 40880377044 |
10 | 14330003341 |
11 | 6093a05675 |
12 | 293b10a011 |
13 | 1474ab3324 |
14 | 99d25a5d3 |
15 | 58d0bbdb1 |
hex | 356227f8d |
14330003341 has 8 divisors (see below), whose sum is σ = 15175630584. Its totient is φ = 13484674560.
The previous prime is 14330003339. The next prime is 14330003381.
It is a happy number.
14330003341 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 1868746441 + 12461256900 = 43229^2 + 111630^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14330003341 - 21 = 14330003339 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14330003381) 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 7 ways as a sum of consecutive naturals, for example, 28311 + ... + 171643.
It is an arithmetic number, because the mean of its divisors is an integer number (1896953823).
Almost surely, 214330003341 is an apocalyptic number.
It is an amenable number.
14330003341 is a deficient number, since it is larger than the sum of its proper divisors (845627243).
14330003341 is a wasteful number, since it uses less digits than its factorization.
14330003341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149231.
The product of its (nonzero) digits is 1296, while the sum is 22.
It can be divided in two parts, 1433000 and 3341, that added together give a palindrome (1436341).
The spelling of 14330003341 in words is "fourteen billion, three hundred thirty million, three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •