Base | Representation |
---|---|
bin | 101010011110100… |
… | …1000101010010101 |
3 | 10200022222101001100 |
4 | 1110331020222111 |
5 | 10404334444110 |
6 | 353233220313 |
7 | 50214645516 |
oct | 12475105225 |
9 | 3608871040 |
10 | 1425312405 |
11 | 671608340 |
12 | 339401699 |
13 | 1993a1c2a |
14 | d7420a0d |
15 | 851e4bc0 |
hex | 54f48a95 |
1425312405 has 48 divisors (see below), whose sum is σ = 2713127040. Its totient is φ = 686448000.
The previous prime is 1425312359. The next prime is 1425312407. The reversal of 1425312405 is 5042135241.
1425312405 is a `hidden beast` number, since 1 + 4 + 253 + 1 + 2 + 405 = 666.
It is not a de Polignac number, because 1425312405 - 212 = 1425308309 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1425312407) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 65211 + ... + 84279.
It is an arithmetic number, because the mean of its divisors is an integer number (56523480).
Almost surely, 21425312405 is an apocalyptic number.
1425312405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1425312405 is a deficient number, since it is larger than the sum of its proper divisors (1287814635).
1425312405 is a wasteful number, since it uses less digits than its factorization.
1425312405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19242 (or 19239 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 1425312405 is about 37753.3098548988. The cubic root of 1425312405 is about 1125.3907857204.
Adding to 1425312405 its reverse (5042135241), we get a palindrome (6467447646).
The spelling of 1425312405 in words is "one billion, four hundred twenty-five million, three hundred twelve thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •