Base | Representation |
---|---|
bin | 11110011001000001000… |
… | …11100011010000111000 |
3 | 10200211022201020221200210 |
4 | 33030200203203100320 |
5 | 114102032122241240 |
6 | 2115413132031120 |
7 | 135304553055405 |
oct | 17144043432070 |
9 | 3624281227623 |
10 | 1044223243320 |
11 | 372941886174 |
12 | 14a4643024a0 |
13 | 776152a453a |
14 | 3877d87b2ac |
15 | 1c268dbe780 |
hex | f3208e3438 |
1044223243320 has 32 divisors (see below), whose sum is σ = 3132669730320. Its totient is φ = 278459531520.
The previous prime is 1044223243291. The next prime is 1044223243321. The reversal of 1044223243320 is 233423224401.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044223243321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4350930061 + ... + 4350930300.
Almost surely, 21044223243320 is an apocalyptic number.
1044223243320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1044223243320 is an abundant number, since it is smaller than the sum of its proper divisors (2088446487000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1044223243320 is a wasteful number, since it uses less digits than its factorization.
1044223243320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8701860375 (or 8701860371 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 1044223243320 its reverse (233423224401), we get a palindrome (1277646467721).
The spelling of 1044223243320 in words is "one trillion, forty-four billion, two hundred twenty-three million, two hundred forty-three thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •