Base | Representation |
---|---|
bin | 111011101100011111111… |
… | …101100101000110001000 |
3 | 112112011120110110222201110 |
4 | 323230133331211012020 |
5 | 1014202331340112404 |
6 | 12420312145450320 |
7 | 602243040464241 |
oct | 73543775450610 |
9 | 15464513428643 |
10 | 4102230004104 |
11 | 134182298a871 |
12 | 5630586409a0 |
13 | 239ab961361b |
14 | 10279860bcc8 |
15 | 71a95d8bb89 |
hex | 3bb1ff65188 |
4102230004104 has 192 divisors, whose sum is σ = 10901138152320. Its totient is φ = 1285352755200.
The previous prime is 4102230004097. The next prime is 4102230004127. The reversal of 4102230004104 is 4014000322014.
It is a super-2 number, since 2×41022300041042 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 153737644 + ... + 153764324.
It is an arithmetic number, because the mean of its divisors is an integer number (56776761210).
Almost surely, 24102230004104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4102230004104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5450569076160).
4102230004104 is an abundant number, since it is smaller than the sum of its proper divisors (6798908148216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4102230004104 is a wasteful number, since it uses less digits than its factorization.
4102230004104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26912 (or 26867 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 4102230004104 its reverse (4014000322014), we get a palindrome (8116230326118).
The spelling of 4102230004104 in words is "four trillion, one hundred two billion, two hundred thirty million, four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •