Base | Representation |
---|---|
bin | 11010011101001000… |
… | …01100101111010111 |
3 | 1100122211110212120101 |
4 | 31032210030233113 |
5 | 213041432422403 |
6 | 10305203514531 |
7 | 1011651425245 |
oct | 151644145727 |
9 | 40584425511 |
10 | 14203014103 |
11 | 602925a793 |
12 | 2904688a47 |
13 | 14546b0075 |
14 | 98a441795 |
15 | 581d8571d |
hex | 34e90cbd7 |
14203014103 has 16 divisors (see below), whose sum is σ = 14749963200. Its totient is φ = 13660012800.
The previous prime is 14203014097. The next prime is 14203014109. The reversal of 14203014103 is 30141030241.
It is an interprime number because it is at equal distance from previous prime (14203014097) and next prime (14203014109).
It is a cyclic number.
It is not a de Polignac number, because 14203014103 - 217 = 14202883031 is a prime.
It is a super-2 number, since 2×142030141032 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14203014109) 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 15 ways as a sum of consecutive naturals, for example, 14448150 + ... + 14449132.
It is an arithmetic number, because the mean of its divisors is an integer number (921872700).
Almost surely, 214203014103 is an apocalyptic number.
14203014103 is a deficient number, since it is larger than the sum of its proper divisors (546949097).
14203014103 is an equidigital number, since it uses as much as digits as its factorization.
14203014103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2442.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 14203014103 its reverse (30141030241), we get a palindrome (44344044344).
The spelling of 14203014103 in words is "fourteen billion, two hundred three million, fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •