Base | Representation |
---|---|
bin | 111011101100011001001… |
… | …000010000110100000110 |
3 | 112112011021110202200012110 |
4 | 323230121020100310012 |
5 | 1014202113013122402 |
6 | 12420252532401450 |
7 | 602240146165650 |
oct | 73543110206406 |
9 | 15464243680173 |
10 | 4102115364102 |
11 | 13417741aa068 |
12 | 563026176286 |
13 | 239a9b9452c2 |
14 | 1027872c96d0 |
15 | 71a8ac9456c |
hex | 3bb19210d06 |
4102115364102 has 128 divisors (see below), whose sum is σ = 9571161600000. Its totient is φ = 1147929449472.
The previous prime is 4102115364047. The next prime is 4102115364131. The reversal of 4102115364102 is 2014635112014.
It is a self number, because there is not a number n which added to its sum of digits gives 4102115364102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 409837674 + ... + 409847682.
It is an arithmetic number, because the mean of its divisors is an integer number (74774700000).
Almost surely, 24102115364102 is an apocalyptic number.
4102115364102 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 4102115364102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4785580800000).
4102115364102 is an abundant number, since it is smaller than the sum of its proper divisors (5469046235898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4102115364102 is a wasteful number, since it uses less digits than its factorization.
4102115364102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11078.
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 4102115364102 in words is "four trillion, one hundred two billion, one hundred fifteen million, three hundred sixty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •