Base | Representation |
---|---|
bin | 111010011010000101101… |
… | …010100000011001101000 |
3 | 112012201011120121221201010 |
4 | 322122011222200121220 |
5 | 1011230120420420302 |
6 | 12311515420023520 |
7 | 562661160541524 |
oct | 72320552403150 |
9 | 15181146557633 |
10 | 4013741966952 |
11 | 130824477a853 |
12 | 549a82091ba0 |
13 | 231656b11723 |
14 | dc3a2448d84 |
15 | 6e61761e16c |
hex | 3a685aa0668 |
4013741966952 has 32 divisors (see below), whose sum is σ = 10562478861600. Its totient is φ = 1267497463104.
The previous prime is 4013741966921. The next prime is 4013741966953. The reversal of 4013741966952 is 2596691473104.
It is a super-2 number, since 2×40137419669522 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 4013741966892 and 4013741966901.
It is not an unprimeable number, because it can be changed into a prime (4013741966953) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4401032403 + ... + 4401033314.
It is an arithmetic number, because the mean of its divisors is an integer number (330077464425).
Almost surely, 24013741966952 is an apocalyptic number.
It is an amenable number.
4013741966952 is an abundant number, since it is smaller than the sum of its proper divisors (6548736894648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4013741966952 is a wasteful number, since it uses less digits than its factorization.
4013741966952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8802065745 (or 8802065741 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 4013741966952 in words is "four trillion, thirteen billion, seven hundred forty-one million, nine hundred sixty-six thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •