Base | Representation |
---|---|
bin | 1110111010111001… |
… | …0101110000011001 |
3 | 101100010100102211100 |
4 | 3232232111300121 |
5 | 31200303001040 |
6 | 1501231422013 |
7 | 201152000460 |
oct | 35656256031 |
9 | 11303312740 |
10 | 4005125145 |
11 | 177587488a |
12 | 939384909 |
13 | 4ba9c7448 |
14 | 29dcc99d7 |
15 | 186938b30 |
hex | eeb95c19 |
4005125145 has 24 divisors (see below), whose sum is σ = 7933962816. Its totient is φ = 1830914208.
The previous prime is 4005125141. The next prime is 4005125161. The reversal of 4005125145 is 5415215004.
4005125145 is a `hidden beast` number, since 4 + 0 + 0 + 512 + 5 + 145 = 666.
It is not a de Polignac number, because 4005125145 - 22 = 4005125141 is a prime.
It is a super-2 number, since 2×40051251452 = 32082054854222542050, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (4005125141) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6357027 + ... + 6357656.
It is an arithmetic number, because the mean of its divisors is an integer number (330581784).
Almost surely, 24005125145 is an apocalyptic number.
4005125145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4005125145 is a deficient number, since it is larger than the sum of its proper divisors (3928837671).
4005125145 is a wasteful number, since it uses less digits than its factorization.
4005125145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12714701 (or 12714698 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 4005125145 is about 63286.0580617880. The cubic root of 4005125145 is about 1588.0787343292.
The spelling of 4005125145 in words is "four billion, five million, one hundred twenty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •