Base | Representation |
---|---|
bin | 1001010100101101100001… |
… | …0101101111000011000001 |
3 | 1100022000201012020001121011 |
4 | 2111023120111233003001 |
5 | 2320424402403412031 |
6 | 33445234341200521 |
7 | 2105432532251134 |
oct | 225133025570301 |
9 | 40260635201534 |
10 | 10251421544641 |
11 | 32a2670231852 |
12 | 1196964400141 |
13 | 59492189a394 |
14 | 27625866021b |
15 | 12b9e295a6b1 |
hex | 952d856f0c1 |
10251421544641 has 8 divisors (see below), whose sum is σ = 10381261017600. Its totient is φ = 10121583937920.
The previous prime is 10251421544627. The next prime is 10251421544737. The reversal of 10251421544641 is 14644512415201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10251421544641 - 213 = 10251421536449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10251421544594 and 10251421544603.
It is not an unprimeable number, because it can be changed into a prime (10251421544621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13054920 + ... + 13817878.
It is an arithmetic number, because the mean of its divisors is an integer number (1297657627200).
Almost surely, 210251421544641 is an apocalyptic number.
It is an amenable number.
10251421544641 is a deficient number, since it is larger than the sum of its proper divisors (129839472959).
10251421544641 is an equidigital number, since it uses as much as digits as its factorization.
10251421544641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 933119.
The product of its (nonzero) digits is 153600, while the sum is 40.
Adding to 10251421544641 its reverse (14644512415201), we get a palindrome (24895933959842).
The spelling of 10251421544641 in words is "ten trillion, two hundred fifty-one billion, four hundred twenty-one million, five hundred forty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •