Base | Representation |
---|---|
bin | 10010001100010011011100… |
… | …11101000000000000000001 |
3 | 12020122110100200011121100001 |
4 | 21012021232131000000001 |
5 | 20220421101143202011 |
6 | 221030043021200001 |
7 | 11266164421352542 |
oct | 1106115635000001 |
9 | 166573320147301 |
10 | 40005178490881 |
11 | 118241123639aa |
12 | 45a1331400001 |
13 | 194261a3bc356 |
14 | 9c43921604c9 |
15 | 49595e67e7c1 |
hex | 24626e740001 |
40005178490881 has 4 divisors (see below), whose sum is σ = 40009460334592. Its totient is φ = 40000896647172.
The previous prime is 40005178490869. The next prime is 40005178490897. The reversal of 40005178490881 is 18809487150004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 40005178490881 - 227 = 40005044273153 is a prime.
It is a super-2 number, since 2×400051784908812 (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 (40005178490831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2140907841 + ... + 2140926526.
It is an arithmetic number, because the mean of its divisors is an integer number (10002365083648).
Almost surely, 240005178490881 is an apocalyptic number.
It is an amenable number.
40005178490881 is a deficient number, since it is larger than the sum of its proper divisors (4281843711).
40005178490881 is an equidigital number, since it uses as much as digits as its factorization.
40005178490881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4281843710.
The product of its (nonzero) digits is 2580480, while the sum is 55.
The spelling of 40005178490881 in words is "forty trillion, five billion, one hundred seventy-eight million, four hundred ninety thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •