Base | Representation |
---|---|
bin | 11110011001000001111… |
… | …10001000101101000110 |
3 | 10200211100012101000111200 |
4 | 33030200332020231012 |
5 | 114102040413244142 |
6 | 2115413541243330 |
7 | 135304666232445 |
oct | 17144076105506 |
9 | 3624305330450 |
10 | 1044230212422 |
11 | 372945806161 |
12 | 14a466703546 |
13 | 77616874677 |
14 | 38780772d5c |
15 | 1c2697e964c |
hex | f320f88b46 |
1044230212422 has 24 divisors (see below), whose sum is σ = 2335482626880. Its totient is φ = 336848455440.
The previous prime is 1044230212373. The next prime is 1044230212427. The reversal of 1044230212422 is 2242120324401.
It is a happy number.
1044230212422 is a `hidden beast` number, since 1 + 0 + 4 + 4 + 23 + 0 + 212 + 422 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044230212427) 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 11 ways as a sum of consecutive naturals, for example, 935689597 + ... + 935690712.
It is an arithmetic number, because the mean of its divisors is an integer number (97311776120).
Almost surely, 21044230212422 is an apocalyptic number.
1044230212422 is an abundant number, since it is smaller than the sum of its proper divisors (1291252414458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1044230212422 is a wasteful number, since it uses less digits than its factorization.
1044230212422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871380348 (or 1871380345 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 1044230212422 its reverse (2242120324401), we get a palindrome (3286350536823).
The spelling of 1044230212422 in words is "one trillion, forty-four billion, two hundred thirty million, two hundred twelve thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •