Base | Representation |
---|---|
bin | 10010011110100111001100… |
… | …10110101000011011011101 |
3 | 12022212121010010012020200101 |
4 | 21033103212112220123131 |
5 | 20311222423330000410 |
6 | 222231041424501101 |
7 | 11362504504203553 |
oct | 1117234626503335 |
9 | 168777103166611 |
10 | 40634255312605 |
11 | 11a46988877a79 |
12 | 4683235a7a791 |
13 | 1989a420912c6 |
14 | a069cbdbbbd3 |
15 | 4a6ecc06bd3a |
hex | 24f4e65a86dd |
40634255312605 has 8 divisors (see below), whose sum is σ = 48761238491064. Its totient is φ = 32507316172800.
The previous prime is 40634255312591. The next prime is 40634255312621. The reversal of 40634255312605 is 50621355243604.
It can be written as a sum of positive squares in 4 ways, for example, as 289679691961 + 40344575620644 = 538219^2 + 6351738^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40634255312605 - 27 = 40634255312477 is a prime.
It is a super-2 number, since 2×406342553126052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8944516 + ... + 12699325.
It is an arithmetic number, because the mean of its divisors is an integer number (6095154811383).
Almost surely, 240634255312605 is an apocalyptic number.
It is an amenable number.
40634255312605 is a deficient number, since it is larger than the sum of its proper divisors (8126983178459).
40634255312605 is a wasteful number, since it uses less digits than its factorization.
40634255312605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22019327.
The product of its (nonzero) digits is 2592000, while the sum is 46.
The spelling of 40634255312605 in words is "forty trillion, six hundred thirty-four billion, two hundred fifty-five million, three hundred twelve thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •