Base | Representation |
---|---|
bin | 1011011011011100000001… |
… | …11001111000010111000001 |
3 | 10021222121010102112210222222 |
4 | 11231232000321320113001 |
5 | 11243230332133234401 |
6 | 125241253334140425 |
7 | 5202504535614302 |
oct | 555560071702701 |
9 | 107877112483888 |
10 | 25132016305601 |
11 | 800a479017997 |
12 | 299a9054b1715 |
13 | 1103c28bb585a |
14 | 62c578bb07a9 |
15 | 2d8b1c44ec1b |
hex | 16db80e785c1 |
25132016305601 has 12 divisors (see below), whose sum is σ = 25689379702980. Its totient is φ = 24586504068480.
The previous prime is 25132016305579. The next prime is 25132016305619. The reversal of 25132016305601 is 10650361023152.
It can be written as a sum of positive squares in 2 ways, for example, as 18771431425201 + 6360584880400 = 4332601^2 + 2522020^2 .
It is not a de Polignac number, because 25132016305601 - 26 = 25132016305537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25132016505601) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2544845 + ... + 7532613.
It is an arithmetic number, because the mean of its divisors is an integer number (2140781641915).
Almost surely, 225132016305601 is an apocalyptic number.
It is an amenable number.
25132016305601 is a deficient number, since it is larger than the sum of its proper divisors (557363397379).
25132016305601 is an equidigital number, since it uses as much as digits as its factorization.
25132016305601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4990144 (or 4990097 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 25132016305601 its reverse (10650361023152), we get a palindrome (35782377328753).
The spelling of 25132016305601 in words is "twenty-five trillion, one hundred thirty-two billion, sixteen million, three hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •