Base | Representation |
---|---|
bin | 111010100010000000001… |
… | …100101100101001111101 |
3 | 112020112002211112222200221 |
4 | 322202000030230221331 |
5 | 1011400021442420331 |
6 | 12315442554421341 |
7 | 563411601413215 |
oct | 72420014545175 |
9 | 15215084488627 |
10 | 4022240201341 |
11 | 131090580905a |
12 | 54b654131851 |
13 | 2323ac63c09b |
14 | dc96ad69245 |
15 | 6e963734711 |
hex | 3a88032ca7d |
4022240201341 has 8 divisors (see below), whose sum is σ = 4023362664000. Its totient is φ = 4021117889280.
The previous prime is 4022240201321. The next prime is 4022240201363. The reversal of 4022240201341 is 1431020422204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4022240201341 - 229 = 4021703330429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4022240201321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70811890 + ... + 70868668.
It is an arithmetic number, because the mean of its divisors is an integer number (502920333000).
Almost surely, 24022240201341 is an apocalyptic number.
It is an amenable number.
4022240201341 is a deficient number, since it is larger than the sum of its proper divisors (1122462659).
4022240201341 is a wasteful number, since it uses less digits than its factorization.
4022240201341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75299.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 4022240201341 its reverse (1431020422204), we get a palindrome (5453260623545).
The spelling of 4022240201341 in words is "four trillion, twenty-two billion, two hundred forty million, two hundred one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •