Base | Representation |
---|---|
bin | 1111011011010011… |
… | …0001111101010001 |
3 | 101200121002011221202 |
4 | 3312310301331101 |
5 | 31440100444444 |
6 | 1522524400545 |
7 | 204422120255 |
oct | 36664617521 |
9 | 11617064852 |
10 | 4141031249 |
11 | 1835560083 |
12 | 9769a6155 |
13 | 50cc00264 |
14 | 2b3d86265 |
15 | 19383234e |
hex | f6d31f51 |
4141031249 has 16 divisors (see below), whose sum is σ = 4339008000. Its totient is φ = 3946884480.
The previous prime is 4141031233. The next prime is 4141031263. The reversal of 4141031249 is 9421301414.
4141031249 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4141031249 - 24 = 4141031233 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4141033249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2556962 + ... + 2558580.
It is an arithmetic number, because the mean of its divisors is an integer number (271188000).
Almost surely, 24141031249 is an apocalyptic number.
It is an amenable number.
4141031249 is a deficient number, since it is larger than the sum of its proper divisors (197976751).
4141031249 is a wasteful number, since it uses less digits than its factorization.
4141031249 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2728.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 4141031249 is about 64350.8449750273. The cubic root of 4141031249 is about 1605.8420866824.
The spelling of 4141031249 in words is "four billion, one hundred forty-one million, thirty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •