Base | Representation |
---|---|
bin | 101011101011000… |
… | …1001110011101010 |
3 | 10210010110022100211 |
4 | 1113112021303222 |
5 | 11000122101010 |
6 | 401225051334 |
7 | 51212623321 |
oct | 12726116352 |
9 | 3703408324 |
10 | 1465425130 |
11 | 692215654 |
12 | 34a926b4a |
13 | 1a47a7b80 |
14 | dc8a30b8 |
15 | 889ba08a |
hex | 57589cea |
1465425130 has 16 divisors (see below), whose sum is σ = 2840670504. Its totient is φ = 541080000.
The previous prime is 1465425119. The next prime is 1465425133. The reversal of 1465425130 is 315245641.
It is a happy number.
1465425130 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 943165521 + 522259609 = 30711^2 + 22853^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1465425092 and 1465425101.
It is not an unprimeable number, because it can be changed into a prime (1465425133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5636121 + ... + 5636380.
Almost surely, 21465425130 is an apocalyptic number.
1465425130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1465425130 is a deficient number, since it is larger than the sum of its proper divisors (1375245374).
1465425130 is a wasteful number, since it uses less digits than its factorization.
1465425130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11272521.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 1465425130 is about 38280.8715940481. The cubic root of 1465425130 is about 1135.8505995460.
The spelling of 1465425130 in words is "one billion, four hundred sixty-five million, four hundred twenty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •