Base | Representation |
---|---|
bin | 11010100000100110… |
… | …10110000100100001 |
3 | 1100201212022010220222 |
4 | 31100103112010201 |
5 | 213121412302210 |
6 | 10312124212425 |
7 | 1012454165402 |
oct | 152023260441 |
9 | 40655263828 |
10 | 14232150305 |
11 | 604375019a |
12 | 291239a115 |
13 | 145a741b19 |
14 | 9902679a9 |
15 | 5846dd655 |
hex | 3504d6121 |
14232150305 has 4 divisors (see below), whose sum is σ = 17078580372. Its totient is φ = 11385720240.
The previous prime is 14232150281. The next prime is 14232150391. The reversal of 14232150305 is 50305123241.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7728695569 + 6503454736 = 87913^2 + 80644^2 .
It is a de Polignac number, because none of the positive numbers 2k-14232150305 is a prime.
It is a super-2 number, since 2×142321503052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1423215026 + ... + 1423215035.
It is an arithmetic number, because the mean of its divisors is an integer number (4269645093).
Almost surely, 214232150305 is an apocalyptic number.
It is an amenable number.
14232150305 is a deficient number, since it is larger than the sum of its proper divisors (2846430067).
14232150305 is an equidigital number, since it uses as much as digits as its factorization.
14232150305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2846430066.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 14232150305 its reverse (50305123241), we get a palindrome (64537273546).
The spelling of 14232150305 in words is "fourteen billion, two hundred thirty-two million, one hundred fifty thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •