Base | Representation |
---|---|
bin | 11010100000011110… |
… | …00111110010100011 |
3 | 1100201210012220022101 |
4 | 31100033013302203 |
5 | 213121121340420 |
6 | 10312044351231 |
7 | 1012441604653 |
oct | 152017076243 |
9 | 40653186271 |
10 | 14231043235 |
11 | 6043064462 |
12 | 2911b45517 |
13 | 145a444c56 |
14 | 99005a363 |
15 | 58457060a |
hex | 3503c7ca3 |
14231043235 has 4 divisors (see below), whose sum is σ = 17077251888. Its totient is φ = 11384834584.
The previous prime is 14231043227. The next prime is 14231043271. The reversal of 14231043235 is 53234013241.
It is a happy number.
14231043235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53234013241 = 29 ⋅1835655629.
It is a cyclic number.
It is not a de Polignac number, because 14231043235 - 23 = 14231043227 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1423104319 + ... + 1423104328.
It is an arithmetic number, because the mean of its divisors is an integer number (4269312972).
Almost surely, 214231043235 is an apocalyptic number.
14231043235 is a deficient number, since it is larger than the sum of its proper divisors (2846208653).
14231043235 is an equidigital number, since it uses as much as digits as its factorization.
14231043235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2846208652.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 14231043235 its reverse (53234013241), we get a palindrome (67465056476).
The spelling of 14231043235 in words is "fourteen billion, two hundred thirty-one million, forty-three thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •