Base | Representation |
---|---|
bin | 100000010101011010001… |
… | …0011101011110111001100 |
3 | 120201211210110222221020222 |
4 | 1000222310103223313030 |
5 | 1040302323414241330 |
6 | 13241315530130512 |
7 | 636032663206340 |
oct | 100526423536714 |
9 | 16654713887228 |
10 | 4444021243340 |
11 | 1463776155708 |
12 | 5b9345880a38 |
13 | 2630b9638053 |
14 | 11513db93620 |
15 | 7a8ec40a0e5 |
hex | 40ab44ebdcc |
4444021243340 has 48 divisors (see below), whose sum is σ = 10800659251200. Its totient is φ = 1504377531072.
The previous prime is 4444021243327. The next prime is 4444021243357. The reversal of 4444021243340 is 433421204444.
It is a super-2 number, since 2×44440212433402 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 4444021243340.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 200894060 + ... + 200916179.
It is an arithmetic number, because the mean of its divisors is an integer number (225013734400).
Almost surely, 24444021243340 is an apocalyptic number.
It is an amenable number.
4444021243340 is an abundant number, since it is smaller than the sum of its proper divisors (6356638007860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4444021243340 is a wasteful number, since it uses less digits than its factorization.
4444021243340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401810334 (or 401810332 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 35.
Adding to 4444021243340 its reverse (433421204444), we get a palindrome (4877442447784).
The spelling of 4444021243340 in words is "four trillion, four hundred forty-four billion, twenty-one million, two hundred forty-three thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •