Base | Representation |
---|---|
bin | 10111010100001101111101… |
… | …000111100011101111101101 |
3 | 111110002011010120022221120222 |
4 | 113110031331013203233231 |
5 | 101420042004442403141 |
6 | 1002032133353421125 |
7 | 30412406620434206 |
oct | 2724157507435755 |
9 | 443064116287528 |
10 | 102544443325421 |
11 | 2a745943a24669 |
12 | b60197270a7a5 |
13 | 452ab902cc976 |
14 | 1b4726b2485ad |
15 | bcc63a00d14b |
hex | 5d437d1e3bed |
102544443325421 has 8 divisors (see below), whose sum is σ = 107004109575744. Its totient is φ = 98084878091200.
The previous prime is 102544443325409. The next prime is 102544443325447. The reversal of 102544443325421 is 124523344445201.
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 102544443325421 - 218 = 102544443063277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102544443325921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23175980 + ... + 27243621.
It is an arithmetic number, because the mean of its divisors is an integer number (13375513696968).
Almost surely, 2102544443325421 is an apocalyptic number.
It is an amenable number.
102544443325421 is a deficient number, since it is larger than the sum of its proper divisors (4459666250323).
102544443325421 is an equidigital number, since it uses as much as digits as its factorization.
102544443325421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50508051.
The product of its (nonzero) digits is 1843200, while the sum is 44.
The spelling of 102544443325421 in words is "one hundred two trillion, five hundred forty-four billion, four hundred forty-three million, three hundred twenty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •