Base | Representation |
---|---|
bin | 111011101100011010110… |
… | …101100000000001100111 |
3 | 112112011100110122112102002 |
4 | 323230122311200001213 |
5 | 1014202142331000403 |
6 | 12420255434235515 |
7 | 602240644453562 |
oct | 73543265400147 |
9 | 15464313575362 |
10 | 4102144000103 |
11 | 1341789388786 |
12 | 563033885b9b |
13 | 239aa4860496 |
14 | 10278b0214d9 |
15 | 71a8d54e188 |
hex | 3bb1ad60067 |
4102144000103 has 8 divisors (see below), whose sum is σ = 4281610864128. Its totient is φ = 3922769867544.
The previous prime is 4102144000043. The next prime is 4102144000127. The reversal of 4102144000103 is 3010004412014.
4102144000103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4102144000103 - 218 = 4102143737959 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 (4102144000303) 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, 23092451 + ... + 23269412.
It is an arithmetic number, because the mean of its divisors is an integer number (535201358016).
Almost surely, 24102144000103 is an apocalyptic number.
4102144000103 is a deficient number, since it is larger than the sum of its proper divisors (179466864025).
4102144000103 is a wasteful number, since it uses less digits than its factorization.
4102144000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46365733.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 4102144000103 its reverse (3010004412014), we get a palindrome (7112148412117).
The spelling of 4102144000103 in words is "four trillion, one hundred two billion, one hundred forty-four million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •