Base | Representation |
---|---|
bin | 1110111100110011… |
… | …1110001100111101 |
3 | 101100200110101220022 |
4 | 3233030332030331 |
5 | 31204331431013 |
6 | 1502115501525 |
7 | 201310153511 |
oct | 35714761475 |
9 | 11320411808 |
10 | 4013155133 |
11 | 177a359939 |
12 | 93bbb78a5 |
13 | 4bc579410 |
14 | 2a0dba141 |
15 | 1874c3008 |
hex | ef33e33d |
4013155133 has 16 divisors (see below), whose sum is σ = 4618096560. Its totient is φ = 3454534656.
The previous prime is 4013155103. The next prime is 4013155147. The reversal of 4013155133 is 3315513104.
It can be written as a sum of positive squares in 8 ways, for example, as 215884249 + 3797270884 = 14693^2 + 61622^2 .
It is a cyclic number.
It is not a de Polignac number, because 4013155133 - 210 = 4013154109 is a prime.
It is a super-2 number, since 2×40131551332 = 32210828243048495378, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4013155103) 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, 59210 + ... + 107387.
It is an arithmetic number, because the mean of its divisors is an integer number (288631035).
Almost surely, 24013155133 is an apocalyptic number.
It is an amenable number.
4013155133 is a deficient number, since it is larger than the sum of its proper divisors (604941427).
4013155133 is a wasteful number, since it uses less digits than its factorization.
4013155133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166736.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 4013155133 is about 63349.4682929541. The cubic root of 4013155133 is about 1589.1393537230.
Adding to 4013155133 its reverse (3315513104), we get a palindrome (7328668237).
The spelling of 4013155133 in words is "four billion, thirteen million, one hundred fifty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •