Base | Representation |
---|---|
bin | 1101001000110010100100… |
… | …0101001110000010011011 |
3 | 1220010220012111011100010012 |
4 | 3102030221011032002123 |
5 | 3343130133022004043 |
6 | 50415442005112135 |
7 | 3020410150204313 |
oct | 322145105160233 |
9 | 56126174140105 |
10 | 14444664250523 |
11 | 4669a47441521 |
12 | 17535809b864b |
13 | 80a183a696a0 |
14 | 37d1a8462443 |
15 | 1a0b13a13a18 |
hex | d232914e09b |
14444664250523 has 8 divisors (see below), whose sum is σ = 15555830227728. Its totient is φ = 13333503695904.
The previous prime is 14444664250501. The next prime is 14444664250571. The reversal of 14444664250523 is 32505246644441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14444664250523 - 212 = 14444664246427 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14444664250823) 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 7 ways as a sum of consecutive naturals, for example, 5437736 + ... + 7645802.
It is an arithmetic number, because the mean of its divisors is an integer number (1944478778466).
Almost surely, 214444664250523 is an apocalyptic number.
14444664250523 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
14444664250523 is a deficient number, since it is larger than the sum of its proper divisors (1111165977205).
14444664250523 is a wasteful number, since it uses less digits than its factorization.
14444664250523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2711293.
The product of its (nonzero) digits is 11059200, while the sum is 50.
The spelling of 14444664250523 in words is "fourteen trillion, four hundred forty-four billion, six hundred sixty-four million, two hundred fifty thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •