Base | Representation |
---|---|
bin | 101101100110011010100111… |
… | …1110101111000110001110011 |
3 | 1221121012011122012221000222102 |
4 | 1123030311033311320301303 |
5 | 410033142033311114103 |
6 | 3541024352522531015 |
7 | 150325545015624542 |
oct | 13314651765706163 |
9 | 1847164565830872 |
10 | 401104040332403 |
11 | 1068932a5009181 |
12 | 38ba0797666a6b |
13 | 142a6c443c9655 |
14 | 7109779564159 |
15 | 315898366ee88 |
hex | 16ccd4fd78c73 |
401104040332403 has 24 divisors (see below), whose sum is σ = 412568072847696. Its totient is φ = 389853056736000.
The previous prime is 401104040332337. The next prime is 401104040332477. The reversal of 401104040332403 is 304233040401104.
It is a happy number.
It is not a de Polignac number, because 401104040332403 - 224 = 401104023555187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401104040332703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 779113628 + ... + 779628278.
It is an arithmetic number, because the mean of its divisors is an integer number (17190336368654).
Almost surely, 2401104040332403 is an apocalyptic number.
401104040332403 is a deficient number, since it is larger than the sum of its proper divisors (11464032515293).
401104040332403 is an equidigital number, since it uses as much as digits as its factorization.
401104040332403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 516503 (or 516414 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 401104040332403 its reverse (304233040401104), we get a palindrome (705337080733507).
The spelling of 401104040332403 in words is "four hundred one trillion, one hundred four billion, forty million, three hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •