Base | Representation |
---|---|
bin | 1111011100010011… |
… | …1000001010111000 |
3 | 101200220000120100211 |
4 | 3313010320022320 |
5 | 31442141013000 |
6 | 1523155040504 |
7 | 204503023612 |
oct | 36704701270 |
9 | 11626016324 |
10 | 4145251000 |
11 | 1837982480 |
12 | 9782a0134 |
13 | 510a49b57 |
14 | 2b4763db2 |
15 | 193db77ba |
hex | f71382b8 |
4145251000 has 64 divisors (see below), whose sum is σ = 10581723360. Its totient is φ = 1507360000.
The previous prime is 4145250997. The next prime is 4145251009. The reversal of 4145251000 is 1525414.
4145251000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4145251009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 177421 + ... + 199420.
Almost surely, 24145251000 is an apocalyptic number.
4145251000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4145251000 is an abundant number, since it is smaller than the sum of its proper divisors (6436472360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4145251000 is a wasteful number, since it uses less digits than its factorization.
4145251000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376873 (or 376859 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 4145251000 is about 64383.6236942283. The cubic root of 4145251000 is about 1606.3873577318.
Adding to 4145251000 its reverse (1525414), we get a palindrome (4146776414).
The spelling of 4145251000 in words is "four billion, one hundred forty-five million, two hundred fifty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •