Base | Representation |
---|---|
bin | 1101000010110000111011… |
… | …1000001001101011110111 |
3 | 1212210000000002011222022020 |
4 | 3100230032320021223313 |
5 | 3334431131210331403 |
6 | 50300121541004223 |
7 | 3010053644414442 |
oct | 320541670115367 |
9 | 55700002158266 |
10 | 14341145402103 |
11 | 462a055785533 |
12 | 17374b06b3673 |
13 | 800497221420 |
14 | 378187d38659 |
15 | 19d0a58e7453 |
hex | d0b0ee09af7 |
14341145402103 has 64 divisors (see below), whose sum is σ = 22866055833600. Its totient is φ = 7905118814208.
The previous prime is 14341145402083. The next prime is 14341145402119. The reversal of 14341145402103 is 30120454114341.
It is not a de Polignac number, because 14341145402103 - 229 = 14340608531191 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14341145402153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 671575 + ... + 5397527.
It is an arithmetic number, because the mean of its divisors is an integer number (357282122400).
Almost surely, 214341145402103 is an apocalyptic number.
14341145402103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14341145402103 is a deficient number, since it is larger than the sum of its proper divisors (8524910431497).
14341145402103 is a wasteful number, since it uses less digits than its factorization.
14341145402103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4726208.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 14341145402103 its reverse (30120454114341), we get a palindrome (44461599516444).
The spelling of 14341145402103 in words is "fourteen trillion, three hundred forty-one billion, one hundred forty-five million, four hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •