Base | Representation |
---|---|
bin | 11011000010000101… |
… | …11001001000001001 |
3 | 1101110102212100000212 |
4 | 31201002321020021 |
5 | 214210320100441 |
6 | 10400041010505 |
7 | 1022434614323 |
oct | 154102711011 |
9 | 41412770025 |
10 | 14513050121 |
11 | 61782693a9 |
12 | 2990483a35 |
13 | 14a39b2c2b |
14 | 9b96a8613 |
15 | 59e1c7eeb |
hex | 3610b9209 |
14513050121 has 2 divisors, whose sum is σ = 14513050122. Its totient is φ = 14513050120.
The previous prime is 14513050109. The next prime is 14513050171. The reversal of 14513050121 is 12105031541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14414643721 + 98406400 = 120061^2 + 9920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14513050121 is a prime.
It is a super-2 number, since 2×145130501212 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14513050171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7256525060 + 7256525061.
It is an arithmetic number, because the mean of its divisors is an integer number (7256525061).
Almost surely, 214513050121 is an apocalyptic number.
It is an amenable number.
14513050121 is a deficient number, since it is larger than the sum of its proper divisors (1).
14513050121 is an equidigital number, since it uses as much as digits as its factorization.
14513050121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 23.
Adding to 14513050121 its reverse (12105031541), we get a palindrome (26618081662).
The spelling of 14513050121 in words is "fourteen billion, five hundred thirteen million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •