Base | Representation |
---|---|
bin | 1100010000101100100… |
… | …11100111101110011101 |
3 | 1111021101210121001221021 |
4 | 12020112103213232131 |
5 | 23400240421142323 |
6 | 521311150404141 |
7 | 42302510506201 |
oct | 6102623475635 |
9 | 1437353531837 |
10 | 421281037213 |
11 | 152734187663 |
12 | 69792200651 |
13 | 3095a54195a |
14 | 16566670b01 |
15 | ae59d5b05d |
hex | 62164e7b9d |
421281037213 has 4 divisors (see below), whose sum is σ = 422780258268. Its totient is φ = 419781816160.
The previous prime is 421281037141. The next prime is 421281037237. The reversal of 421281037213 is 312730182124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 122162832324 + 299118204889 = 349518^2 + 546917^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421281037213 is a prime.
It is a super-2 number, since 2×4212810372132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421281137213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 749610106 + ... + 749610667.
It is an arithmetic number, because the mean of its divisors is an integer number (105695064567).
Almost surely, 2421281037213 is an apocalyptic number.
It is an amenable number.
421281037213 is a deficient number, since it is larger than the sum of its proper divisors (1499221055).
421281037213 is a wasteful number, since it uses less digits than its factorization.
421281037213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1499221054.
The product of its (nonzero) digits is 16128, while the sum is 34.
The spelling of 421281037213 in words is "four hundred twenty-one billion, two hundred eighty-one million, thirty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •