Base | Representation |
---|---|
bin | 111100011011111111010… |
… | …010000011100101111001 |
3 | 112201001012010122210122011 |
4 | 330123333102003211321 |
5 | 1021021244130100241 |
6 | 12455544042525521 |
7 | 606026460556636 |
oct | 74337722034571 |
9 | 15631163583564 |
10 | 4153221331321 |
11 | 136140a192707 |
12 | 570b095068a1 |
13 | 241854874aaa |
14 | 10503486d18d |
15 | 7307c79d281 |
hex | 3c6ff483979 |
4153221331321 has 4 divisors (see below), whose sum is σ = 4179674970532. Its totient is φ = 4126767692112.
The previous prime is 4153221331229. The next prime is 4153221331331. The reversal of 4153221331321 is 1231331223514.
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 2919522412921 + 1233698918400 = 1708661^2 + 1110720^2 .
It is a cyclic number.
It is not a de Polignac number, because 4153221331321 - 213 = 4153221323129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4153221331331) 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, 13226819370 + ... + 13226819683.
It is an arithmetic number, because the mean of its divisors is an integer number (1044918742633).
Almost surely, 24153221331321 is an apocalyptic number.
It is an amenable number.
4153221331321 is a deficient number, since it is larger than the sum of its proper divisors (26453639211).
4153221331321 is a wasteful number, since it uses less digits than its factorization.
4153221331321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26453639210.
The product of its digits is 12960, while the sum is 31.
Adding to 4153221331321 its reverse (1231331223514), we get a palindrome (5384552554835).
The spelling of 4153221331321 in words is "four trillion, one hundred fifty-three billion, two hundred twenty-one million, three hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •