Base | Representation |
---|---|
bin | 101111101101000001… |
… | …0000110000011110001 |
3 | 100210102101010110222201 |
4 | 1133122002012003301 |
5 | 3134300202330001 |
6 | 115021124303201 |
7 | 10254420405406 |
oct | 1373202060361 |
9 | 323371113881 |
10 | 102442230001 |
11 | 3a499a71701 |
12 | 17a2b841b01 |
13 | 9877792c57 |
14 | 4d5b5542ad |
15 | 29e8853501 |
hex | 17da0860f1 |
102442230001 has 4 divisors (see below), whose sum is σ = 102455028900. Its totient is φ = 102429431104.
The previous prime is 102442229999. The next prime is 102442230029. The reversal of 102442230001 is 100032244201.
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 42024590001 + 60417640000 = 204999^2 + 245800^2 .
It is a cyclic number.
It is not a de Polignac number, because 102442230001 - 21 = 102442229999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102442230041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6387436 + ... + 6403453.
It is an arithmetic number, because the mean of its divisors is an integer number (25613757225).
Almost surely, 2102442230001 is an apocalyptic number.
It is an amenable number.
102442230001 is a deficient number, since it is larger than the sum of its proper divisors (12798899).
102442230001 is an equidigital number, since it uses as much as digits as its factorization.
102442230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12798898.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 102442230001 its reverse (100032244201), we get a palindrome (202474474202).
The spelling of 102442230001 in words is "one hundred two billion, four hundred forty-two million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •