Base | Representation |
---|---|
bin | 10010001101011010000000… |
… | …00101101100100001101011 |
3 | 12020210002010101010200020012 |
4 | 21012231000011230201223 |
5 | 20222031134131214111 |
6 | 221055305313322135 |
7 | 11302005145256213 |
oct | 1106550005544153 |
9 | 166702111120205 |
10 | 40043055335531 |
11 | 118391898a89a6 |
12 | 45a874226634b |
13 | 1946075637371 |
14 | 9c6146775243 |
15 | 496929a7848b |
hex | 246b4016c86b |
40043055335531 has 8 divisors (see below), whose sum is σ = 40091156084784. Its totient is φ = 39994966028160.
The previous prime is 40043055335527. The next prime is 40043055335537. The reversal of 40043055335531 is 13553355034004.
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 40043055335531 - 22 = 40043055335527 is a prime.
It is a super-2 number, since 2×400430553355312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40043055335537) 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, 4153436 + ... + 9865958.
It is an arithmetic number, because the mean of its divisors is an integer number (5011394510598).
Almost surely, 240043055335531 is an apocalyptic number.
40043055335531 is a deficient number, since it is larger than the sum of its proper divisors (48100749253).
40043055335531 is an equidigital number, since it uses as much as digits as its factorization.
40043055335531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5720941.
The product of its (nonzero) digits is 810000, while the sum is 41.
The spelling of 40043055335531 in words is "forty trillion, forty-three billion, fifty-five million, three hundred thirty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •