Base | Representation |
---|---|
bin | 110000111101011111… |
… | …0111101111010110000 |
3 | 101001101120020112200020 |
4 | 1201322332331322300 |
5 | 3210312442321000 |
6 | 120145105323440 |
7 | 10411346601216 |
oct | 1417276757260 |
9 | 331346215606 |
10 | 105142542000 |
11 | 40655251011 |
12 | 18464036580 |
13 | 9bb80586c2 |
14 | 5136028cb6 |
15 | 2b0594aba0 |
hex | 187afbdeb0 |
105142542000 has 160 divisors (see below), whose sum is σ = 356820971520. Its totient is φ = 26562297600.
The previous prime is 105142541989. The next prime is 105142542031. The reversal of 105142542000 is 245241501.
It is a super-2 number, since 2×1051425420002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 31 ways as a sum of consecutive naturals, for example, 347152 + ... + 575151.
It is an arithmetic number, because the mean of its divisors is an integer number (2230131072).
Almost surely, 2105142542000 is an apocalyptic number.
105142542000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105142542000 is an abundant number, since it is smaller than the sum of its proper divisors (251678429520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105142542000 is a wasteful number, since it uses less digits than its factorization.
105142542000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 922348 (or 922332 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
Adding to 105142542000 its reverse (245241501), we get a palindrome (105387783501).
The spelling of 105142542000 in words is "one hundred five billion, one hundred forty-two million, five hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •