Base | Representation |
---|---|
bin | 101010000111000… |
… | …1111111101010101 |
3 | 10122110211221010120 |
4 | 1110032033331111 |
5 | 10343213142100 |
6 | 352113542153 |
7 | 50005325166 |
oct | 12416177525 |
9 | 3573757116 |
10 | 1413021525 |
11 | 665682a93 |
12 | 335274959 |
13 | 19698a716 |
14 | d594176d |
15 | 840b80a0 |
hex | 5438ff55 |
1413021525 has 24 divisors (see below), whose sum is σ = 2349269280. Its totient is φ = 749394240.
The previous prime is 1413021517. The next prime is 1413021553. The reversal of 1413021525 is 5251203141.
It is a happy number.
It is not a de Polignac number, because 1413021525 - 23 = 1413021517 is a prime.
It is a super-2 number, since 2×14130215252 = 3993259660226651250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1413021495 and 1413021504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 39202 + ... + 66051.
It is an arithmetic number, because the mean of its divisors is an integer number (97886220).
Almost surely, 21413021525 is an apocalyptic number.
1413021525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1413021525 is a deficient number, since it is larger than the sum of its proper divisors (936247755).
1413021525 is a wasteful number, since it uses less digits than its factorization.
1413021525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105445 (or 105440 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1413021525 is about 37590.1785710044. The cubic root of 1413021525 is about 1122.1465860953.
Adding to 1413021525 its reverse (5251203141), we get a palindrome (6664224666).
The spelling of 1413021525 in words is "one billion, four hundred thirteen million, twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •