Base | Representation |
---|---|
bin | 10011011101000100… |
… | …10001010111110001 |
3 | 222221220000010022221 |
4 | 21232202101113301 |
5 | 132342232144101 |
6 | 4444220001041 |
7 | 516552016633 |
oct | 115642212761 |
9 | 28856003287 |
10 | 10444412401 |
11 | 447a664695 |
12 | 2035990181 |
13 | ca5aabaa7 |
14 | 7111a8a53 |
15 | 411de5aa1 |
hex | 26e8915f1 |
10444412401 has 8 divisors (see below), whose sum is σ = 11083239360. Its totient is φ = 9820978992.
The previous prime is 10444412393. The next prime is 10444412413. The reversal of 10444412401 is 10421444401.
10444412401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10444412401 - 23 = 10444412393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10444412431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3846990 + ... + 3849703.
It is an arithmetic number, because the mean of its divisors is an integer number (1385404920).
Almost surely, 210444412401 is an apocalyptic number.
It is an amenable number.
10444412401 is a deficient number, since it is larger than the sum of its proper divisors (638826959).
10444412401 is an equidigital number, since it uses as much as digits as its factorization.
10444412401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7696775.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 10444412401 its reverse (10421444401), we get a palindrome (20865856802).
The spelling of 10444412401 in words is "ten billion, four hundred forty-four million, four hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •