Base | Representation |
---|---|
bin | 100111110100011… |
… | …1111000011111101 |
3 | 10110010012011011110 |
4 | 1033220333003331 |
5 | 10214023103000 |
6 | 340330112233 |
7 | 45053015631 |
oct | 11750770375 |
9 | 3403164143 |
10 | 1336144125 |
11 | 626244948 |
12 | 31357b679 |
13 | 183a81734 |
14 | c964cdc1 |
15 | 7c47e850 |
hex | 4fa3f0fd |
1336144125 has 64 divisors (see below), whose sum is σ = 2352280320. Its totient is φ = 671673600.
The previous prime is 1336144123. The next prime is 1336144181. The reversal of 1336144125 is 5214416331.
It is not a de Polignac number, because 1336144125 - 21 = 1336144123 is a prime.
It is a super-2 number, since 2×13361441252 = 3570562245544031250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1336144092 and 1336144101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1336144123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1973287 + ... + 1973963.
It is an arithmetic number, because the mean of its divisors is an integer number (36754380).
Almost surely, 21336144125 is an apocalyptic number.
1336144125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1336144125 is a deficient number, since it is larger than the sum of its proper divisors (1016136195).
1336144125 is a wasteful number, since it uses less digits than its factorization.
1336144125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 991 (or 981 counting only the distinct ones).
The product of its digits is 8640, while the sum is 30.
The square root of 1336144125 is about 36553.3052541080. The cubic root of 1336144125 is about 1101.4152925867.
The spelling of 1336144125 in words is "one billion, three hundred thirty-six million, one hundred forty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •