Base | Representation |
---|---|
bin | 11110101011100110011… |
… | …10101101100110001100 |
3 | 10201210002000201002102221 |
4 | 33111303032231212030 |
5 | 114233000224133030 |
6 | 2124143133225124 |
7 | 136110031025140 |
oct | 17256316554614 |
9 | 3653060632387 |
10 | 1054200224140 |
11 | 3770a15a8568 |
12 | 1503896321a4 |
13 | 7854529229b |
14 | 3904892b220 |
15 | 1c64ec31e7a |
hex | f5733ad98c |
1054200224140 has 48 divisors (see below), whose sum is σ = 2531229748992. Its totient is φ = 361275903936.
The previous prime is 1054200224093. The next prime is 1054200224167. The reversal of 1054200224140 is 414220024501.
It is a super-2 number, since 2×10542002241402 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1400614 + ... + 2017453.
It is an arithmetic number, because the mean of its divisors is an integer number (52733953104).
Almost surely, 21054200224140 is an apocalyptic number.
1054200224140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1054200224140 is an abundant number, since it is smaller than the sum of its proper divisors (1477029524852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054200224140 is a wasteful number, since it uses less digits than its factorization.
1054200224140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3420286 (or 3420284 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 25.
Adding to 1054200224140 its reverse (414220024501), we get a palindrome (1468420248641).
The spelling of 1054200224140 in words is "one trillion, fifty-four billion, two hundred million, two hundred twenty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •