Base | Representation |
---|---|
bin | 100000010100000110011… |
… | …1100101101001010101101 |
3 | 120201120112210120221122020 |
4 | 1000220030330231022231 |
5 | 1040231101114034201 |
6 | 13240133144540353 |
7 | 635603260144113 |
oct | 100501474551255 |
9 | 16646483527566 |
10 | 4441213424301 |
11 | 1462565217705 |
12 | 5b88a14816b9 |
13 | 262a5ca00b74 |
14 | 114d54cd5ab3 |
15 | 7a7d5b78a36 |
hex | 40a0cf2d2ad |
4441213424301 has 8 divisors (see below), whose sum is σ = 6112637831424. Its totient is φ = 2865298983360.
The previous prime is 4441213424273. The next prime is 4441213424339. The reversal of 4441213424301 is 1034243121444.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4441213424301 - 27 = 4441213424173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4441213424341) 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, 23877491436 + ... + 23877491621.
It is an arithmetic number, because the mean of its divisors is an integer number (764079728928).
Almost surely, 24441213424301 is an apocalyptic number.
It is an amenable number.
4441213424301 is a deficient number, since it is larger than the sum of its proper divisors (1671424407123).
4441213424301 is a wasteful number, since it uses less digits than its factorization.
4441213424301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47754983091.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 4441213424301 its reverse (1034243121444), we get a palindrome (5475456545745).
The spelling of 4441213424301 in words is "four trillion, four hundred forty-one billion, two hundred thirteen million, four hundred twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •