Base | Representation |
---|---|
bin | 1101000110111101100000… |
… | …0011110010100001010111 |
3 | 1220000220002111011122020002 |
4 | 3101233120003302201113 |
5 | 3342121303434300403 |
6 | 50353203501401515 |
7 | 3015215345565224 |
oct | 321573003624127 |
9 | 56026074148202 |
10 | 14413240150103 |
11 | 46576913487a3 |
12 | 1749470b6929b |
13 | 807216638222 |
14 | 37b866c3094b |
15 | 19edc4d84188 |
hex | d1bd80f2857 |
14413240150103 has 2 divisors, whose sum is σ = 14413240150104. Its totient is φ = 14413240150102.
The previous prime is 14413240150063. The next prime is 14413240150117. The reversal of 14413240150103 is 30105104231441.
14413240150103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14413240150103 - 210 = 14413240149079 is a prime.
It is a super-2 number, since 2×144132401501032 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14413240150163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7206620075051 + 7206620075052.
It is an arithmetic number, because the mean of its divisors is an integer number (7206620075052).
Almost surely, 214413240150103 is an apocalyptic number.
14413240150103 is a deficient number, since it is larger than the sum of its proper divisors (1).
14413240150103 is an equidigital number, since it uses as much as digits as its factorization.
14413240150103 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 14413240150103 its reverse (30105104231441), we get a palindrome (44518344381544).
The spelling of 14413240150103 in words is "fourteen trillion, four hundred thirteen billion, two hundred forty million, one hundred fifty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •