Base | Representation |
---|---|
bin | 100000010100000000110… |
… | …0111000011111011110011 |
3 | 120201120001112122121100012 |
4 | 1000220001213003323303 |
5 | 1040230203414413021 |
6 | 13240102231445135 |
7 | 635565460236215 |
oct | 100500147037363 |
9 | 16646045577305 |
10 | 4441023201011 |
11 | 1462477902081 |
12 | 5b88498267ab |
13 | 262a2c48a8c7 |
14 | 114d3793a5b5 |
15 | 7a7c410135b |
hex | 40a019c3ef3 |
4441023201011 has 8 divisors (see below), whose sum is σ = 4733818653600. Its totient is φ = 4151734281088.
The previous prime is 4441023200987. The next prime is 4441023201037. The reversal of 4441023201011 is 1101023201444.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4441023201011 is a prime.
It is a super-2 number, since 2×44410232010112 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4441023201211) 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, 876630551 + ... + 876635616.
It is an arithmetic number, because the mean of its divisors is an integer number (591727331700).
Almost surely, 24441023201011 is an apocalyptic number.
4441023201011 is a deficient number, since it is larger than the sum of its proper divisors (292795452589).
4441023201011 is a wasteful number, since it uses less digits than its factorization.
4441023201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1753266333.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 4441023201011 its reverse (1101023201444), we get a palindrome (5542046402455).
The spelling of 4441023201011 in words is "four trillion, four hundred forty-one billion, twenty-three million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •