Base | Representation |
---|---|
bin | 11001001000010… |
… | …000111001000010 |
3 | 1002101022100000000 |
4 | 121020100321002 |
5 | 1330412043423 |
6 | 105500140430 |
7 | 13306341003 |
oct | 3110207102 |
9 | 1071270000 |
10 | 421596738 |
11 | 1a6a86962 |
12 | b9237716 |
13 | 69463734 |
14 | 3ddc71aa |
15 | 2702c843 |
hex | 19210e42 |
421596738 has 108 divisors (see below), whose sum is σ = 1012343670. Its totient is φ = 131639904.
The previous prime is 421596737. The next prime is 421596761. The reversal of 421596738 is 837695124.
421596738 is a `hidden beast` number, since 4 + 21 + 596 + 7 + 38 = 666.
It can be written as a sum of positive squares in only one way, i.e., 400280049 + 21316689 = 20007^2 + 4617^2 .
It is a junction number, because it is equal to n+sod(n) for n = 421596693 and 421596702.
It is not an unprimeable number, because it can be changed into a prime (421596737) by changing a digit.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 4736998 + ... + 4737086.
Almost surely, 2421596738 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 421596738, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (506171835).
421596738 is an abundant number, since it is smaller than the sum of its proper divisors (590746932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
421596738 is an frugal number, since it uses more digits than its factorization.
421596738 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153 (or 113 counting only the distinct ones).
The product of its digits is 362880, while the sum is 45.
The square root of 421596738 is about 20532.8209946904. The cubic root of 421596738 is about 749.8350677325.
The spelling of 421596738 in words is "four hundred twenty-one million, five hundred ninety-six thousand, seven hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •