Base | Representation |
---|---|
bin | 111011001010111111111… |
… | …001101110110001111101 |
3 | 112101201201120000120100110 |
4 | 323022333321232301331 |
5 | 1013110144203102333 |
6 | 12352002522420233 |
7 | 566530452122442 |
oct | 73127771566175 |
9 | 15351646016313 |
10 | 4066258644093 |
11 | 1328543aa7668 |
12 | 558099961679 |
13 | 2365a609c709 |
14 | 100b450cb9c9 |
15 | 70b8cdd6063 |
hex | 3b2bfe6ec7d |
4066258644093 has 64 divisors (see below), whose sum is σ = 5976999475200. Its totient is φ = 2447506575360.
The previous prime is 4066258644043. The next prime is 4066258644121. The reversal of 4066258644093 is 3904468526604.
It is not a de Polignac number, because 4066258644093 - 212 = 4066258639997 is a prime.
It is a super-2 number, since 2×40662586440932 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4066258644013) 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 63 ways as a sum of consecutive naturals, for example, 954742798 + ... + 954747056.
It is an arithmetic number, because the mean of its divisors is an integer number (93390616800).
Almost surely, 24066258644093 is an apocalyptic number.
It is an amenable number.
4066258644093 is a deficient number, since it is larger than the sum of its proper divisors (1910740831107).
4066258644093 is a wasteful number, since it uses less digits than its factorization.
4066258644093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6802.
The product of its (nonzero) digits is 29859840, while the sum is 57.
The spelling of 4066258644093 in words is "four trillion, sixty-six billion, two hundred fifty-eight million, six hundred forty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •