Base | Representation |
---|---|
bin | 1011111101000110101111… |
… | …1100110111111000110110 |
3 | 1201112121000121100201210122 |
4 | 2333101223330313320312 |
5 | 3210324223211423210 |
6 | 43542243054251542 |
7 | 2524436521261430 |
oct | 277215374677066 |
9 | 51477017321718 |
10 | 13144411045430 |
11 | 42085713a7625 |
12 | 15835847b6bb2 |
13 | 744688379a62 |
14 | 33629b405650 |
15 | 17bdb2774b55 |
hex | bf46bf37e36 |
13144411045430 has 128 divisors (see below), whose sum is σ = 29142855254016. Its totient is φ = 4169209968000.
The previous prime is 13144411045343. The next prime is 13144411045457. The reversal of 13144411045430 is 3454011444131.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 85918505 + ... + 86071355.
It is an arithmetic number, because the mean of its divisors is an integer number (227678556672).
Almost surely, 213144411045430 is an apocalyptic number.
13144411045430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13144411045430 is an abundant number, since it is smaller than the sum of its proper divisors (15998444208586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13144411045430 is a wasteful number, since it uses less digits than its factorization.
13144411045430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154642.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 13144411045430 its reverse (3454011444131), we get a palindrome (16598422489561).
The spelling of 13144411045430 in words is "thirteen trillion, one hundred forty-four billion, four hundred eleven million, forty-five thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •