Base | Representation |
---|---|
bin | 100101110000101111… |
… | …010011010100001111 |
3 | 10212122201202000120220 |
4 | 211300233103110033 |
5 | 1131014303404433 |
6 | 30343204442423 |
7 | 2633525422524 |
oct | 456057232417 |
9 | 125581660526 |
10 | 40546153743 |
11 | 16217279477 |
12 | 7a369a9413 |
13 | 3a92277164 |
14 | 1d68d3914b |
15 | 10c491a2b3 |
hex | 970bd350f |
40546153743 has 8 divisors (see below), whose sum is σ = 54062471856. Its totient is φ = 27030302400.
The previous prime is 40546153693. The next prime is 40546153777. The reversal of 40546153743 is 34735164504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40546153743 - 212 = 40546149647 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 40546153695 and 40546153704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40546153783) 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, 256483 + ... + 383243.
It is an arithmetic number, because the mean of its divisors is an integer number (6757808982).
Almost surely, 240546153743 is an apocalyptic number.
40546153743 is a deficient number, since it is larger than the sum of its proper divisors (13516318113).
40546153743 is a wasteful number, since it uses less digits than its factorization.
40546153743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233385.
The product of its (nonzero) digits is 604800, while the sum is 42.
The spelling of 40546153743 in words is "forty billion, five hundred forty-six million, one hundred fifty-three thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •