Base | Representation |
---|---|
bin | 111011010100011000000… |
… | …000110011101101010001 |
3 | 112102200201020002100102100 |
4 | 323110120000303231101 |
5 | 1013241304132011011 |
6 | 12400345542511013 |
7 | 600335115231036 |
oct | 73243000635521 |
9 | 15380636070370 |
10 | 4076326828881 |
11 | 133184025293a |
12 | 55a029735469 |
13 | 23751bc413c8 |
14 | 10141c31d38d |
15 | 7107bc61d56 |
hex | 3b518033b51 |
4076326828881 has 12 divisors (see below), whose sum is σ = 5920558183540. Its totient is φ = 2702537123040.
The previous prime is 4076326828879. The next prime is 4076326828897. The reversal of 4076326828881 is 1888286236704.
It can be written as a sum of positive squares in 2 ways, for example, as 1499608422225 + 2576718406656 = 1224585^2 + 1605216^2 .
It is not a de Polignac number, because 4076326828881 - 21 = 4076326828879 is a prime.
It is a super-2 number, since 2×40763268288812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4076326828831) 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 11 ways as a sum of consecutive naturals, for example, 1251172966 + ... + 1251176223.
Almost surely, 24076326828881 is an apocalyptic number.
It is an amenable number.
4076326828881 is a deficient number, since it is larger than the sum of its proper divisors (1844231354659).
4076326828881 is a wasteful number, since it uses less digits than its factorization.
4076326828881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2502349376 (or 2502349373 counting only the distinct ones).
The product of its (nonzero) digits is 49545216, while the sum is 63.
The spelling of 4076326828881 in words is "four trillion, seventy-six billion, three hundred twenty-six million, eight hundred twenty-eight thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •