Base | Representation |
---|---|
bin | 11010100000011000… |
… | …10011001001100111 |
3 | 1100201201211022100200 |
4 | 31100030103021213 |
5 | 213120424201320 |
6 | 10312020441543 |
7 | 1012432403553 |
oct | 152014231147 |
9 | 40651738320 |
10 | 14230303335 |
11 | 60426a9576 |
12 | 29118492b3 |
13 | 145a246241 |
14 | 98dd06863 |
15 | 584476290 |
hex | 350313267 |
14230303335 has 48 divisors (see below), whose sum is σ = 25557012000. Its totient is φ = 7316128512.
The previous prime is 14230303313. The next prime is 14230303349. The reversal of 14230303335 is 53330303241.
It is a happy number.
14230303335 is a `hidden beast` number, since 1 + 4 + 23 + 0 + 303 + 335 = 666.
It is not a de Polignac number, because 14230303335 - 225 = 14196748903 is a prime.
It is a super-2 number, since 2×142303033352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14230303299 and 14230303308.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 843816 + ... + 860514.
It is an arithmetic number, because the mean of its divisors is an integer number (532437750).
Almost surely, 214230303335 is an apocalyptic number.
14230303335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14230303335 is a deficient number, since it is larger than the sum of its proper divisors (11326708665).
14230303335 is a wasteful number, since it uses less digits than its factorization.
14230303335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17392 (or 17389 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 27.
Adding to 14230303335 its reverse (53330303241), we get a palindrome (67560606576).
The spelling of 14230303335 in words is "fourteen billion, two hundred thirty million, three hundred three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •