Base | Representation |
---|---|
bin | 111010011001101101110… |
… | …101001001011010101100 |
3 | 112012200010201012202202222 |
4 | 322121231311021122230 |
5 | 1011223311034300322 |
6 | 12311412013334512 |
7 | 562645234005161 |
oct | 72315565113254 |
9 | 15180121182688 |
10 | 4013342103212 |
11 | 1308059a98252 |
12 | 549990197438 |
13 | 2315c201a170 |
14 | dc3652bc068 |
15 | 6e5e2485e42 |
hex | 3a66dd496ac |
4013342103212 has 48 divisors (see below), whose sum is σ = 8146846498560. Its totient is φ = 1714011824448.
The previous prime is 4013342103179. The next prime is 4013342103223. The reversal of 4013342103212 is 2123012433104.
It is a super-2 number, since 2×40133421032122 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is an unprimeable number.
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, 47191088 + ... + 47276055.
It is an arithmetic number, because the mean of its divisors is an integer number (169725968720).
Almost surely, 24013342103212 is an apocalyptic number.
It is an amenable number.
4013342103212 is an abundant number, since it is smaller than the sum of its proper divisors (4133504395348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4013342103212 is a wasteful number, since it uses less digits than its factorization.
4013342103212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94467222 (or 94467220 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 4013342103212 its reverse (2123012433104), we get a palindrome (6136354536316).
The spelling of 4013342103212 in words is "four trillion, thirteen billion, three hundred forty-two million, one hundred three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •