Base | Representation |
---|---|
bin | 111101001000101011101… |
… | …000110101110110100000 |
3 | 112212122001120001222022210 |
4 | 331020223220311312200 |
5 | 1022313034244021422 |
6 | 12534002001402120 |
7 | 612345621666204 |
oct | 75105350656640 |
9 | 15778046058283 |
10 | 4201210142112 |
11 | 137a7a5666515 |
12 | 57a280939340 |
13 | 246231a50519 |
14 | 1074a8030b04 |
15 | 7443a7c010c |
hex | 3d22ba35da0 |
4201210142112 has 48 divisors (see below), whose sum is σ = 11161046242080. Its totient is φ = 1383531048192.
The previous prime is 4201210142083. The next prime is 4201210142113. The reversal of 4201210142112 is 2112410121024.
4201210142112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is not an unprimeable number, because it can be changed into a prime (4201210142113) 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, 263622187 + ... + 263638122.
It is an arithmetic number, because the mean of its divisors is an integer number (232521796710).
Almost surely, 24201210142112 is an apocalyptic number.
It is an amenable number.
4201210142112 is an abundant number, since it is smaller than the sum of its proper divisors (6959836099968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4201210142112 is a wasteful number, since it uses less digits than its factorization.
4201210142112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527260405 (or 527260397 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 4201210142112 its reverse (2112410121024), we get a palindrome (6313620263136).
The spelling of 4201210142112 in words is "four trillion, two hundred one billion, two hundred ten million, one hundred forty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •