Base | Representation |
---|---|
bin | 111011100010101000101… |
… | …000111100111010001001 |
3 | 112111011020022002020101110 |
4 | 323202220220330322021 |
5 | 1014014133333021241 |
6 | 12411401142040533 |
7 | 601416415426146 |
oct | 73425050747211 |
9 | 15434208066343 |
10 | 4091638173321 |
11 | 1338288097606 |
12 | 560ba1419149 |
13 | 238abc12aa2a |
14 | 102071a2b3cd |
15 | 71676076816 |
hex | 3b8a8a3ce89 |
4091638173321 has 4 divisors (see below), whose sum is σ = 5455517564432. Its totient is φ = 2727758782212.
The previous prime is 4091638173307. The next prime is 4091638173353. The reversal of 4091638173321 is 1233718361904.
It is a happy number.
4091638173321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 4091638173321 - 215 = 4091638140553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4091638073321) 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, 681939695551 + ... + 681939695556.
It is an arithmetic number, because the mean of its divisors is an integer number (1363879391108).
Almost surely, 24091638173321 is an apocalyptic number.
It is an amenable number.
4091638173321 is a deficient number, since it is larger than the sum of its proper divisors (1363879391111).
4091638173321 is a wasteful number, since it uses less digits than its factorization.
4091638173321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363879391110.
The product of its (nonzero) digits is 653184, while the sum is 48.
The spelling of 4091638173321 in words is "four trillion, ninety-one billion, six hundred thirty-eight million, one hundred seventy-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •