Base | Representation |
---|---|
bin | 10111010001000000111000… |
… | …000111110001110110100001 |
3 | 111102022002202101111002210212 |
4 | 113101000320013301312201 |
5 | 101402440022030020301 |
6 | 1001343035200103505 |
7 | 30360453054600431 |
oct | 2721007007616641 |
9 | 442262671432725 |
10 | 102324242423201 |
11 | 2a670516295657 |
12 | b587159904b95 |
13 | 4513199ac4016 |
14 | 1b3a73c3062c1 |
15 | bc6a4d3864bb |
hex | 5d10381f1da1 |
102324242423201 has 4 divisors (see below), whose sum is σ = 102324597293892. Its totient is φ = 102323887552512.
The previous prime is 102324242423191. The next prime is 102324242423267.
102324242423201 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14645814190225 + 87678428232976 = 3826985^2 + 9363676^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102324242423201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102324242423701) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 177002480 + ... + 177579633.
It is an arithmetic number, because the mean of its divisors is an integer number (25581149323473).
Almost surely, 2102324242423201 is an apocalyptic number.
It is an amenable number.
102324242423201 is a deficient number, since it is larger than the sum of its proper divisors (354870691).
102324242423201 is an equidigital number, since it uses as much as digits as its factorization.
102324242423201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354870690.
The product of its (nonzero) digits is 36864, while the sum is 32.
The spelling of 102324242423201 in words is "one hundred two trillion, three hundred twenty-four billion, two hundred forty-two million, four hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •