Base | Representation |
---|---|
bin | 11010101010010010… |
… | …00100100101101111 |
3 | 1100221112002011211112 |
4 | 31111021010211233 |
5 | 213303203441333 |
6 | 10324144342235 |
7 | 1014461260655 |
oct | 152511044557 |
9 | 40845064745 |
10 | 14313343343 |
11 | 6085566782 |
12 | 293561497b |
13 | 14714cc240 |
14 | 99ad60dd5 |
15 | 58b8ca948 |
hex | 35524496f |
14313343343 has 16 divisors (see below), whose sum is σ = 16018464000. Its totient is φ = 12700247040.
The previous prime is 14313343337. The next prime is 14313343361. The reversal of 14313343343 is 34334331341.
14313343343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14313343343 - 216 = 14313277807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14313343313) 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 15 ways as a sum of consecutive naturals, for example, 59138 + ... + 179231.
It is an arithmetic number, because the mean of its divisors is an integer number (1001154000).
Almost surely, 214313343343 is an apocalyptic number.
14313343343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14313343343 is a deficient number, since it is larger than the sum of its proper divisors (1705120657).
14313343343 is a wasteful number, since it uses less digits than its factorization.
14313343343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238562.
The product of its digits is 46656, while the sum is 32.
Adding to 14313343343 its reverse (34334331341), we get a palindrome (48647674684).
The spelling of 14313343343 in words is "fourteen billion, three hundred thirteen million, three hundred forty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •