Base | Representation |
---|---|
bin | 1101000010010000111010… |
… | …0011011101101011110011 |
3 | 1212202011211001111120011202 |
4 | 3100210032203131223303 |
5 | 3334311030302410103 |
6 | 50252141012401415 |
7 | 3006330644161523 |
oct | 320441643355363 |
9 | 55664731446152 |
10 | 14332550044403 |
11 | 4626444940028 |
12 | 17358b201626b |
13 | 7cc727549756 |
14 | 3779b0575683 |
15 | 19cc50ee9988 |
hex | d090e8ddaf3 |
14332550044403 has 4 divisors (see below), whose sum is σ = 14794890368448. Its totient is φ = 13870209720360.
The previous prime is 14332550044369. The next prime is 14332550044409. The reversal of 14332550044403 is 30444005523341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14332550044403 - 28 = 14332550044147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14332550044409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231170161976 + ... + 231170162037.
It is an arithmetic number, because the mean of its divisors is an integer number (3698722592112).
Almost surely, 214332550044403 is an apocalyptic number.
14332550044403 is a deficient number, since it is larger than the sum of its proper divisors (462340324045).
14332550044403 is an equidigital number, since it uses as much as digits as its factorization.
14332550044403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462340324044.
The product of its (nonzero) digits is 345600, while the sum is 38.
Adding to 14332550044403 its reverse (30444005523341), we get a palindrome (44776555567744).
The spelling of 14332550044403 in words is "fourteen trillion, three hundred thirty-two billion, five hundred fifty million, forty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •