Base | Representation |
---|---|
bin | 111110100101111100000… |
… | …110000111010111000101 |
3 | 120020012112002001020210102 |
4 | 332211330012013113011 |
5 | 1030433123111203333 |
6 | 13052002114533445 |
7 | 622522214536634 |
oct | 76457406072705 |
9 | 16205462036712 |
10 | 4301344241093 |
11 | 140920a763119 |
12 | 595767597285 |
13 | 2527cc282373 |
14 | 10c286bdb51b |
15 | 76d4b697ae8 |
hex | 3e97c1875c5 |
4301344241093 has 2 divisors, whose sum is σ = 4301344241094. Its totient is φ = 4301344241092.
The previous prime is 4301344241071. The next prime is 4301344241221. The reversal of 4301344241093 is 3901424431034.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3646698194689 + 654646046404 = 1909633^2 + 809102^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4301344241093 is a prime.
It is a super-2 number, since 2×43013442410932 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4301344249093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2150672120546 + 2150672120547.
It is an arithmetic number, because the mean of its divisors is an integer number (2150672120547).
Almost surely, 24301344241093 is an apocalyptic number.
It is an amenable number.
4301344241093 is a deficient number, since it is larger than the sum of its proper divisors (1).
4301344241093 is an equidigital number, since it uses as much as digits as its factorization.
4301344241093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 4301344241093 in words is "four trillion, three hundred one billion, three hundred forty-four million, two hundred forty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •