Base | Representation |
---|---|
bin | 111010011001010111010… |
… | …001101111001110101000 |
3 | 112012122011100020000112122 |
4 | 322121113101233032220 |
5 | 1011222022203102102 |
6 | 12311310255330412 |
7 | 562632660554330 |
oct | 72312721571650 |
9 | 15178140200478 |
10 | 4012963722152 |
11 | 1307985448a30 |
12 | 5498a5520a08 |
13 | 231561807b48 |
14 | dc32ad440c0 |
15 | 6e5be1430a2 |
hex | 3a65746f3a8 |
4012963722152 has 64 divisors (see below), whose sum is σ = 9407085465600. Its totient is φ = 1559137141440.
The previous prime is 4012963722151. The next prime is 4012963722161. The reversal of 4012963722152 is 2512273692104.
It is a super-2 number, since 2×40129637221522 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is not an unprimeable number, because it can be changed into a prime (4012963722151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8852048 + ... + 9294335.
It is an arithmetic number, because the mean of its divisors is an integer number (146985710400).
Almost surely, 24012963722152 is an apocalyptic number.
It is an amenable number.
4012963722152 is an abundant number, since it is smaller than the sum of its proper divisors (5394121743448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4012963722152 is a wasteful number, since it uses less digits than its factorization.
4012963722152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18146766 (or 18146762 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 4012963722152 in words is "four trillion, twelve billion, nine hundred sixty-three million, seven hundred twenty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •