Base | Representation |
---|---|
bin | 111011101100011110010… |
… | …011001011000000111101 |
3 | 112112011111111222211012222 |
4 | 323230132103023000331 |
5 | 1014202302220010023 |
6 | 12420305311535125 |
7 | 602242251416330 |
oct | 73543623130075 |
9 | 15464444884188 |
10 | 4102202110013 |
11 | 13418091685a7 |
12 | 56304b22a4a5 |
13 | 239ab38c8047 |
14 | 102794a2a617 |
15 | 71a936cbcc8 |
hex | 3bb1e4cb03d |
4102202110013 has 16 divisors (see below), whose sum is σ = 4839892823040. Its totient is φ = 3402446947200.
The previous prime is 4102202109949. The next prime is 4102202110103. The reversal of 4102202110013 is 3100112022014.
It is not a de Polignac number, because 4102202110013 - 26 = 4102202109949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4102202109973 and 4102202110000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4102202140013) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1635683 + ... + 3298463.
It is an arithmetic number, because the mean of its divisors is an integer number (302493301440).
Almost surely, 24102202110013 is an apocalyptic number.
It is an amenable number.
4102202110013 is a deficient number, since it is larger than the sum of its proper divisors (737690713027).
4102202110013 is a wasteful number, since it uses less digits than its factorization.
4102202110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1674188.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 4102202110013 its reverse (3100112022014), we get a palindrome (7202314132027).
The spelling of 4102202110013 in words is "four trillion, one hundred two billion, two hundred two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •