Base | Representation |
---|---|
bin | 1111000110100101… |
… | …0111111101111111 |
3 | 101110112121102022220 |
4 | 3301221113331333 |
5 | 31300330431020 |
6 | 1510142340423 |
7 | 202315515162 |
oct | 36151277577 |
9 | 11415542286 |
10 | 4054155135 |
11 | 17a0512838 |
12 | 95188a713 |
13 | 4c7c03184 |
14 | 2a660dad9 |
15 | 18adc1240 |
hex | f1a57f7f |
4054155135 has 32 divisors (see below), whose sum is σ = 6517029312. Its totient is φ = 2152120320.
The previous prime is 4054155109. The next prime is 4054155139. The reversal of 4054155135 is 5315514504.
It is not a de Polignac number, because 4054155135 - 211 = 4054153087 is a prime.
It is a super-4 number, since 4×40541551354 (a number of 40 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4054155096 and 4054155105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4054155139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5355177 + ... + 5355933.
It is an arithmetic number, because the mean of its divisors is an integer number (203657166).
Almost surely, 24054155135 is an apocalyptic number.
4054155135 is a deficient number, since it is larger than the sum of its proper divisors (2462874177).
4054155135 is a wasteful number, since it uses less digits than its factorization.
4054155135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1963.
The product of its (nonzero) digits is 30000, while the sum is 33.
The square root of 4054155135 is about 63672.2477614855. The cubic root of 4054155135 is about 1594.5327896550.
Adding to 4054155135 its reverse (5315514504), we get a palindrome (9369669639).
The spelling of 4054155135 in words is "four billion, fifty-four million, one hundred fifty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •