Base | Representation |
---|---|
bin | 100111000001001110011… |
… | …101101100100000101100 |
3 | 100111100002201000000122212 |
4 | 213001032131230200230 |
5 | 322412424224000134 |
6 | 5411450201225552 |
7 | 364502665641440 |
oct | 47011635544054 |
9 | 10440081000585 |
10 | 2681376000044 |
11 | 94418a937685 |
12 | 3738034922b8 |
13 | 165b114211a1 |
14 | 93aca534820 |
15 | 49b3701cbce |
hex | 2704e76c82c |
2681376000044 has 24 divisors (see below), whose sum is σ = 5363391882240. Its totient is φ = 1149024025296.
The previous prime is 2681376000041. The next prime is 2681376000067. The reversal of 2681376000044 is 4400006731862.
It is a super-2 number, since 2×26813760000442 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2681375999965 and 2681376000010.
It is not an unprimeable number, because it can be changed into a prime (2681376000041) 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, 5474204 + ... + 5943875.
It is an arithmetic number, because the mean of its divisors is an integer number (223474661760).
Almost surely, 22681376000044 is an apocalyptic number.
It is an amenable number.
2681376000044 is an abundant number, since it is smaller than the sum of its proper divisors (2682015882196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2681376000044 is a wasteful number, since it uses less digits than its factorization.
2681376000044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11426477 (or 11426475 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 41.
The spelling of 2681376000044 in words is "two trillion, six hundred eighty-one billion, three hundred seventy-six million, forty-four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •