Base | Representation |
---|---|
bin | 1111011011100011… |
… | …1110110011100011 |
3 | 101200200011010112000 |
4 | 3312320332303203 |
5 | 31440341214301 |
6 | 1523004135043 |
7 | 204434354622 |
oct | 36670766343 |
9 | 11620133460 |
10 | 4142132451 |
11 | 1836142466 |
12 | 977237483 |
13 | 5101c7562 |
14 | 2b41916b9 |
15 | 19399d786 |
hex | f6e3ece3 |
4142132451 has 16 divisors (see below), whose sum is σ = 6151965600. Its totient is φ = 2754458784.
The previous prime is 4142132429. The next prime is 4142132453. The reversal of 4142132451 is 1542312414.
4142132451 is a `hidden beast` number, since 41 + 42 + 132 + 451 = 666.
It is not a de Polignac number, because 4142132451 - 211 = 4142130403 is a prime.
It is a super-2 number, since 2×41421324512 = 34314522483254534802, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (4142132453) 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, 182496 + ... + 203933.
It is an arithmetic number, because the mean of its divisors is an integer number (384497850).
Almost surely, 24142132451 is an apocalyptic number.
4142132451 is a deficient number, since it is larger than the sum of its proper divisors (2009833149).
4142132451 is a wasteful number, since it uses less digits than its factorization.
4142132451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386835 (or 386829 counting only the distinct ones).
The product of its digits is 3840, while the sum is 27.
The square root of 4142132451 is about 64359.4006420197. The cubic root of 4142132451 is about 1605.9844183614.
Adding to 4142132451 its reverse (1542312414), we get a palindrome (5684444865).
The spelling of 4142132451 in words is "four billion, one hundred forty-two million, one hundred thirty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •