Base | Representation |
---|---|
bin | 111011101100101100101… |
… | …011010110111000011111 |
3 | 112112012010022220010100102 |
4 | 323230230223112320133 |
5 | 1014203300443043403 |
6 | 12420345250051315 |
7 | 602251240645655 |
oct | 73545453267037 |
9 | 15465108803312 |
10 | 4102443331103 |
11 | 1341922345577 |
12 | 5630b7b79b3b |
13 | 239b21885910 |
14 | 1027b8a9cdd5 |
15 | 71aa9979b88 |
hex | 3bb2cad6e1f |
4102443331103 has 8 divisors (see below), whose sum is σ = 4461758628096. Its totient is φ = 3749376996000.
The previous prime is 4102443331069. The next prime is 4102443331117. The reversal of 4102443331103 is 3011333442014.
It is a happy number.
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 4102443331103 - 212 = 4102443327007 is a prime.
It is a super-2 number, since 2×41024433311032 (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 (4102443331183) 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, 1562239103 + ... + 1562241728.
It is an arithmetic number, because the mean of its divisors is an integer number (557719828512).
Almost surely, 24102443331103 is an apocalyptic number.
4102443331103 is a deficient number, since it is larger than the sum of its proper divisors (359315296993).
4102443331103 is a wasteful number, since it uses less digits than its factorization.
4102443331103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3124480945.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 4102443331103 its reverse (3011333442014), we get a palindrome (7113776773117).
The spelling of 4102443331103 in words is "four trillion, one hundred two billion, four hundred forty-three million, three hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •