Base | Representation |
---|---|
bin | 100000010011101110100… |
… | …1100010111001100000101 |
3 | 120201111110221222122222211 |
4 | 1000213131030113030011 |
5 | 1040222431012102323 |
6 | 13235521444223421 |
7 | 635544361063012 |
oct | 100473514271405 |
9 | 16644427878884 |
10 | 4440412222213 |
11 | 1462193a35720 |
12 | 5b86b909ab71 |
13 | 262962a19aa6 |
14 | 114cba736709 |
15 | 7a78a66570d |
hex | 409dd317305 |
4440412222213 has 8 divisors (see below), whose sum is σ = 4853040015456. Its totient is φ = 4029276754800.
The previous prime is 4440412222187. The next prime is 4440412222319. The reversal of 4440412222213 is 3122222140444.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-4440412222213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4440412222013) 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, 373075231 + ... + 373087132.
It is an arithmetic number, because the mean of its divisors is an integer number (606630001932).
Almost surely, 24440412222213 is an apocalyptic number.
It is an amenable number.
4440412222213 is a deficient number, since it is larger than the sum of its proper divisors (412627793243).
4440412222213 is a wasteful number, since it uses less digits than its factorization.
4440412222213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746162915.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 4440412222213 its reverse (3122222140444), we get a palindrome (7562634362657).
The spelling of 4440412222213 in words is "four trillion, four hundred forty billion, four hundred twelve million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •