Base | Representation |
---|---|
bin | 100101110101001110… |
… | …011001010000111101 |
3 | 10212211222100121110222 |
4 | 211311032121100331 |
5 | 1131143040212222 |
6 | 30354453511125 |
7 | 2635431213533 |
oct | 456516312075 |
9 | 125758317428 |
10 | 40621413437 |
11 | 16255802170 |
12 | 7a580424a5 |
13 | 3aa4a37a17 |
14 | 1d74d2a153 |
15 | 10cb334542 |
hex | 97539943d |
40621413437 has 8 divisors (see below), whose sum is σ = 44319845952. Its totient is φ = 36923910400.
The previous prime is 40621413409. The next prime is 40621413463. The reversal of 40621413437 is 73431412604.
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 40621413437 - 210 = 40621412413 is a prime.
It is a super-3 number, since 3×406214134373 (a number of 33 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40621413397 and 40621413406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40621418437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139364 + ... + 317277.
It is an arithmetic number, because the mean of its divisors is an integer number (5539980744).
Almost surely, 240621413437 is an apocalyptic number.
It is an amenable number.
40621413437 is a deficient number, since it is larger than the sum of its proper divisors (3698432515).
40621413437 is a wasteful number, since it uses less digits than its factorization.
40621413437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464739.
The product of its (nonzero) digits is 48384, while the sum is 35.
The spelling of 40621413437 in words is "forty billion, six hundred twenty-one million, four hundred thirteen thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •