Base | Representation |
---|---|
bin | 1010000010011… |
… | …0101010011000 |
3 | 2221012222021010 |
4 | 2200212222120 |
5 | 41234221100 |
6 | 4102213520 |
7 | 1020566415 |
oct | 240465230 |
9 | 87188233 |
10 | 42101400 |
11 | 21846450 |
12 | 121242a0 |
13 | 8951193 |
14 | 583d10c |
15 | 3a69750 |
hex | 2826a98 |
42101400 has 96 divisors (see below), whose sum is σ = 142401600. Its totient is φ = 10204800.
The previous prime is 42101399. The next prime is 42101419. The reversal of 42101400 is 410124.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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, 3411 + ... + 9789.
It is an arithmetic number, because the mean of its divisors is an integer number (1483350).
Almost surely, 242101400 is an apocalyptic number.
42101400 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 42101400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71200800).
42101400 is an abundant number, since it is smaller than the sum of its proper divisors (100300200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42101400 is a wasteful number, since it uses less digits than its factorization.
42101400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6409 (or 6400 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 42101400 is about 6488.5591620945. The cubic root of 42101400 is about 347.8821770505.
Adding to 42101400 its reverse (410124), we get a palindrome (42511524).
The spelling of 42101400 in words is "forty-two million, one hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •