Base | Representation |
---|---|
bin | 10000010111010100011… |
… | …110100011011010101000 |
3 | 10222111122220120011021001 |
4 | 100113110132203122220 |
5 | 121411040104242212 |
6 | 2220340043524344 |
7 | 144150266565511 |
oct | 20272436433250 |
9 | 3874586504231 |
10 | 1124551243432 |
11 | 3a3a12950621 |
12 | 161b41b296b4 |
13 | 8207735ba56 |
14 | 3c5dddd7a08 |
15 | 1e3bb07d657 |
hex | 105d47a36a8 |
1124551243432 has 8 divisors (see below), whose sum is σ = 2108533581450. Its totient is φ = 562275621712.
The previous prime is 1124551243421. The next prime is 1124551243433. The reversal of 1124551243432 is 2343421554211.
It can be written as a sum of positive squares in only one way, i.e., 767561723236 + 356989520196 = 876106^2 + 597486^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 1124551243391 and 1124551243400.
It is not an unprimeable number, because it can be changed into a prime (1124551243433) 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 as a sum of consecutive naturals, namely, 70284452707 + ... + 70284452722.
Almost surely, 21124551243432 is an apocalyptic number.
It is an amenable number.
1124551243432 is a deficient number, since it is larger than the sum of its proper divisors (983982338018).
1124551243432 is a wasteful number, since it uses less digits than its factorization.
1124551243432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140568905435 (or 140568905431 counting only the distinct ones).
The product of its digits is 115200, while the sum is 37.
Adding to 1124551243432 its reverse (2343421554211), we get a palindrome (3467972797643).
The spelling of 1124551243432 in words is "one trillion, one hundred twenty-four billion, five hundred fifty-one million, two hundred forty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •