Base | Representation |
---|---|
bin | 1000010010011011011… |
… | …1000111110111100101 |
3 | 111121112010012102021200 |
4 | 2010212313013313211 |
5 | 4313101242431000 |
6 | 145224452033113 |
7 | 13200312136632 |
oct | 2044667076745 |
9 | 447463172250 |
10 | 142385905125 |
11 | 55427149a62 |
12 | 23718902799 |
13 | 10571c84289 |
14 | 6c6a45d189 |
15 | 3a85411500 |
hex | 2126dc7de5 |
142385905125 has 24 divisors (see below), whose sum is σ = 256674327000. Its totient is φ = 75939148800.
The previous prime is 142385905099. The next prime is 142385905147. The reversal of 142385905125 is 521509583241.
142385905125 is a `hidden beast` number, since 1 + 4 + 2 + 3 + 8 + 590 + 51 + 2 + 5 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 36214851204 + 106171053921 = 190302^2 + 325839^2 .
It is a de Polignac number, because none of the positive numbers 2k-142385905125 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63281500 + ... + 63283749.
It is an arithmetic number, because the mean of its divisors is an integer number (10694763625).
Almost surely, 2142385905125 is an apocalyptic number.
142385905125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
142385905125 is a deficient number, since it is larger than the sum of its proper divisors (114288421875).
142385905125 is a wasteful number, since it uses less digits than its factorization.
142385905125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126565270 (or 126565257 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 45.
The spelling of 142385905125 in words is "one hundred forty-two billion, three hundred eighty-five million, nine hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •