Base | Representation |
---|---|
bin | 111101101111110011101… |
… | …100010111010001011111 |
3 | 120000122111101022120020111 |
4 | 331233303230113101133 |
5 | 1024010104112324203 |
6 | 13005150420430451 |
7 | 615363656135221 |
oct | 75576354272137 |
9 | 16018441276214 |
10 | 4243221214303 |
11 | 13965a3833895 |
12 | 586446248427 |
13 | 24a198655a16 |
14 | 10953173a411 |
15 | 75598b0526d |
hex | 3dbf3b1745f |
4243221214303 has 8 divisors (see below), whose sum is σ = 4396023017280. Its totient is φ = 4090851666720.
The previous prime is 4243221214279. The next prime is 4243221214313. The reversal of 4243221214303 is 3034121223424.
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 4243221214303 - 213 = 4243221206111 is a prime.
It is a super-2 number, since 2×42432212143032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4243221214313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108043863 + ... + 108083128.
It is an arithmetic number, because the mean of its divisors is an integer number (549502877160).
Almost surely, 24243221214303 is an apocalyptic number.
4243221214303 is a deficient number, since it is larger than the sum of its proper divisors (152801802977).
4243221214303 is a wasteful number, since it uses less digits than its factorization.
4243221214303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216127697.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 4243221214303 its reverse (3034121223424), we get a palindrome (7277342437727).
The spelling of 4243221214303 in words is "four trillion, two hundred forty-three billion, two hundred twenty-one million, two hundred fourteen thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •