Base | Representation |
---|---|
bin | 11110101011100000011… |
… | …11101010010011011110 |
3 | 10201202221112110121111101 |
4 | 33111300033222103132 |
5 | 114232344414004100 |
6 | 2124134143543314 |
7 | 136105552233451 |
oct | 17256017522336 |
9 | 3652845417441 |
10 | 1054150141150 |
11 | 377076300467 |
12 | 1503748bab3a |
13 | 78537aa8192 |
14 | 39042011498 |
15 | 1c64a63c86a |
hex | f5703ea4de |
1054150141150 has 24 divisors (see below), whose sum is σ = 1960802596584. Its totient is φ = 421642135200.
The previous prime is 1054150141117. The next prime is 1054150141151. The reversal of 1054150141150 is 511410514501.
It is a super-2 number, since 2×10541501411502 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054150141151) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 773109 + ... + 1644991.
It is an arithmetic number, because the mean of its divisors is an integer number (81700108191).
Almost surely, 21054150141150 is an apocalyptic number.
1054150141150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1054150141150 is a deficient number, since it is larger than the sum of its proper divisors (906652455434).
1054150141150 is a wasteful number, since it uses less digits than its factorization.
1054150141150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896076 (or 896071 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 28.
Adding to 1054150141150 its reverse (511410514501), we get a palindrome (1565560655651).
The spelling of 1054150141150 in words is "one trillion, fifty-four billion, one hundred fifty million, one hundred forty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •