Base | Representation |
---|---|
bin | 100000010100000011001… |
… | …0000100110111100110001 |
3 | 120201120020222102102111010 |
4 | 1000220012100212330301 |
5 | 1040230333401414301 |
6 | 13240114055341133 |
7 | 635600425233060 |
oct | 100500620467461 |
9 | 16646228372433 |
10 | 4441101201201 |
11 | 1462507937845 |
12 | 5b886b9817a9 |
13 | 262a4269a972 |
14 | 114d440421d7 |
15 | 7a7cadac5d6 |
hex | 40a06426f31 |
4441101201201 has 16 divisors (see below), whose sum is σ = 6985695285248. Its totient is φ = 2455908498000.
The previous prime is 4441101201167. The next prime is 4441101201223. The reversal of 4441101201201 is 1021021011444.
4441101201201 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-4441101201201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4441101201001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3410983375 + ... + 3410984676.
It is an arithmetic number, because the mean of its divisors is an integer number (436605955328).
Almost surely, 24441101201201 is an apocalyptic number.
It is an amenable number.
4441101201201 is a deficient number, since it is larger than the sum of its proper divisors (2544594084047).
4441101201201 is a wasteful number, since it uses less digits than its factorization.
4441101201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6821968092.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 4441101201201 its reverse (1021021011444), we get a palindrome (5462122212645).
The spelling of 4441101201201 in words is "four trillion, four hundred forty-one billion, one hundred one million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •