Base | Representation |
---|---|
bin | 100100011001010111101… |
… | …001101010011001101001 |
3 | 22212002212212000001120022 |
4 | 210121113221222121221 |
5 | 311434314211140031 |
6 | 5153001502410225 |
7 | 345462422006252 |
oct | 44312751523151 |
9 | 8762785001508 |
10 | 2501141505641 |
11 | 8848011a2379 |
12 | 3448a3290975 |
13 | 151b1a035a6c |
14 | 890ad537b29 |
15 | 450d8e4497b |
hex | 24657a6a669 |
2501141505641 has 2 divisors, whose sum is σ = 2501141505642. Its totient is φ = 2501141505640.
The previous prime is 2501141505613. The next prime is 2501141505659. The reversal of 2501141505641 is 1465051411052.
2501141505641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1585874269225 + 915267236416 = 1259315^2 + 956696^2 .
It is a cyclic number.
It is not a de Polignac number, because 2501141505641 - 238 = 2226263598697 is a prime.
It is not a weakly prime, because it can be changed into another prime (2501141508641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1250570752820 + 1250570752821.
It is an arithmetic number, because the mean of its divisors is an integer number (1250570752821).
Almost surely, 22501141505641 is an apocalyptic number.
It is an amenable number.
2501141505641 is a deficient number, since it is larger than the sum of its proper divisors (1).
2501141505641 is an equidigital number, since it uses as much as digits as its factorization.
2501141505641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24000, while the sum is 35.
Adding to 2501141505641 its reverse (1465051411052), we get a palindrome (3966192916693).
The spelling of 2501141505641 in words is "two trillion, five hundred one billion, one hundred forty-one million, five hundred five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •