Base | Representation |
---|---|
bin | 101101110101001110111000… |
… | …1100110001100001110101101 |
3 | 1221212101211220002200110202112 |
4 | 1123222131301212030032231 |
5 | 410320023040303011141 |
6 | 3545224052554533405 |
7 | 150625635311122325 |
oct | 13352356146141655 |
9 | 1855354802613675 |
10 | 403140421141421 |
11 | 1074a898a981277 |
12 | 3926b393437265 |
13 | 143c3c94c74042 |
14 | 717a159a78285 |
15 | 319191a5317eb |
hex | 16ea77198c3ad |
403140421141421 has 8 divisors (see below), whose sum is σ = 406908591786144. Its totient is φ = 399372259814640.
The previous prime is 403140421141417. The next prime is 403140421141429. The reversal of 403140421141421 is 124141124041304.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 403140421141421 - 22 = 403140421141417 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (403140421141429) 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, 109639451 + ... + 113256743.
It is an arithmetic number, because the mean of its divisors is an integer number (50863573973268).
Almost surely, 2403140421141421 is an apocalyptic number.
It is an amenable number.
403140421141421 is a deficient number, since it is larger than the sum of its proper divisors (3768170644723).
403140421141421 is a wasteful number, since it uses less digits than its factorization.
403140421141421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4658971.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 403140421141421 its reverse (124141124041304), we get a palindrome (527281545182725).
The spelling of 403140421141421 in words is "four hundred three trillion, one hundred forty billion, four hundred twenty-one million, one hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •