Base | Representation |
---|---|
bin | 100110110001111… |
… | …0011010000100001 |
3 | 10100200111100211212 |
4 | 1031203303100201 |
5 | 10131103340000 |
6 | 333041515505 |
7 | 44150164202 |
oct | 11543632041 |
9 | 3320440755 |
10 | 1301230625 |
11 | 608568912 |
12 | 303942b95 |
13 | 179779166 |
14 | c4b615a9 |
15 | 79384c35 |
hex | 4d8f3421 |
1301230625 has 10 divisors (see below), whose sum is σ = 1626018570. Its totient is φ = 1040984000.
The previous prime is 1301230603. The next prime is 1301230631. The reversal of 1301230625 is 5260321031.
It can be written as a sum of positive squares in 5 ways, for example, as 669412129 + 631818496 = 25873^2 + 25136^2 .
It is a de Polignac number, because none of the positive numbers 2k-1301230625 is a prime.
It is a super-2 number, since 2×13012306252 = 3386402278875781250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1301230625.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1040360 + ... + 1041609.
It is an arithmetic number, because the mean of its divisors is an integer number (162601857).
Almost surely, 21301230625 is an apocalyptic number.
It is an amenable number.
1301230625 is a deficient number, since it is larger than the sum of its proper divisors (324787945).
1301230625 is an frugal number, since it uses more digits than its factorization.
1301230625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2081989 (or 2081974 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1301230625 is about 36072.5744160297. The cubic root of 1301230625 is about 1091.7371578772.
Adding to 1301230625 its reverse (5260321031), we get a palindrome (6561551656).
The spelling of 1301230625 in words is "one billion, three hundred one million, two hundred thirty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •