Base | Representation |
---|---|
bin | 111010100001001010101… |
… | …111010101010101111001 |
3 | 112020102210022220020202111 |
4 | 322201022233111111321 |
5 | 1011341202341424400 |
6 | 12315213555132321 |
7 | 563350431106222 |
oct | 72411257252571 |
9 | 15212708806674 |
10 | 4021343311225 |
11 | 1310495510259 |
12 | 54b4438a40a1 |
13 | 232298894086 |
14 | dc8c3bbc249 |
15 | 6e90eb1e3ba |
hex | 3a84abd5579 |
4021343311225 has 24 divisors (see below), whose sum is σ = 5147838945792. Its totient is φ = 3112983830400.
The previous prime is 4021343311217. The next prime is 4021343311291. The reversal of 4021343311225 is 5221133431204.
It is not a de Polignac number, because 4021343311225 - 23 = 4021343311217 is a prime.
It is a super-2 number, since 2×40213433112252 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 7573029 + ... + 8086621.
It is an arithmetic number, because the mean of its divisors is an integer number (214493289408).
Almost surely, 24021343311225 is an apocalyptic number.
It is an amenable number.
4021343311225 is a deficient number, since it is larger than the sum of its proper divisors (1126495634567).
4021343311225 is a wasteful number, since it uses less digits than its factorization.
4021343311225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523737 (or 523732 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 4021343311225 its reverse (5221133431204), we get a palindrome (9242476742429).
The spelling of 4021343311225 in words is "four trillion, twenty-one billion, three hundred forty-three million, three hundred eleven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •