Base | Representation |
---|---|
bin | 111011101100011111111… |
… | …110110010100000110000 |
3 | 112112011120111002002200202 |
4 | 323230133332302200300 |
5 | 1014202331430234300 |
6 | 12420312200334332 |
7 | 602243043254564 |
oct | 73543776624060 |
9 | 15464514062622 |
10 | 4102230321200 |
11 | 1341823087030 |
12 | 5630587743a8 |
13 | 239ab96c4a5b |
14 | 1027986916a4 |
15 | 71a95e00ad5 |
hex | 3bb1ffb2830 |
4102230321200 has 120 divisors (see below), whose sum is σ = 10753739316336. Its totient is φ = 1491419520000.
The previous prime is 4102230321199. The next prime is 4102230321263. The reversal of 4102230321200 is 21230322014.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22353014 + ... + 22535786.
Almost surely, 24102230321200 is an apocalyptic number.
4102230321200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4102230321200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5376869658168).
4102230321200 is an abundant number, since it is smaller than the sum of its proper divisors (6651508995136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4102230321200 is a wasteful number, since it uses less digits than its factorization.
4102230321200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 187903 (or 187892 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 4102230321200 its reverse (21230322014), we get a palindrome (4123460643214).
The spelling of 4102230321200 in words is "four trillion, one hundred two billion, two hundred thirty million, three hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •