Base | Representation |
---|---|
bin | 11010001010010011… |
… | …11011110100010111 |
3 | 1100020211101201220222 |
4 | 31011021323310113 |
5 | 212231023242403 |
6 | 10241403544555 |
7 | 1005023445560 |
oct | 150511736427 |
9 | 40224351828 |
10 | 14045134103 |
11 | 5a58126150 |
12 | 287b82b15b |
13 | 142aa82550 |
14 | 9734a5167 |
15 | 57309b338 |
hex | 34527bd17 |
14045134103 has 64 divisors (see below), whose sum is σ = 20507655168. Its totient is φ = 9250744320.
The previous prime is 14045134093. The next prime is 14045134123. The reversal of 14045134103 is 30143154041.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14045134103 is a prime.
It is a super-2 number, since 2×140451341032 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14045134123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 618476 + ... + 640782.
It is an arithmetic number, because the mean of its divisors is an integer number (320432112).
Almost surely, 214045134103 is an apocalyptic number.
14045134103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14045134103 is a deficient number, since it is larger than the sum of its proper divisors (6462521065).
14045134103 is a wasteful number, since it uses less digits than its factorization.
14045134103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22392.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 14045134103 its reverse (30143154041), we get a palindrome (44188288144).
The spelling of 14045134103 in words is "fourteen billion, forty-five million, one hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •