Base | Representation |
---|---|
bin | 111010001110100000110… |
… | …010011001110101001110 |
3 | 112011112002022200022101110 |
4 | 322032200302121311032 |
5 | 1011024141400321032 |
6 | 12302102153152450 |
7 | 562041146563221 |
oct | 72164062316516 |
9 | 15145068608343 |
10 | 4001312120142 |
11 | 1302a46417987 |
12 | 5475933bb726 |
13 | 2304258b829c |
14 | db9436d75b8 |
15 | 6e13b2917cc |
hex | 3a3a0c99d4e |
4001312120142 has 8 divisors (see below), whose sum is σ = 8002624240296. Its totient is φ = 1333770706712.
The previous prime is 4001312120137. The next prime is 4001312120149. The reversal of 4001312120142 is 2410212131004.
4001312120142 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
4001312120142 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4001312120149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 333442676673 + ... + 333442676684.
It is an arithmetic number, because the mean of its divisors is an integer number (1000328030037).
Almost surely, 24001312120142 is an apocalyptic number.
4001312120142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4001312120142 is a wasteful number, since it uses less digits than its factorization.
4001312120142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666885353362.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 4001312120142 its reverse (2410212131004), we get a palindrome (6411524251146).
The spelling of 4001312120142 in words is "four trillion, one billion, three hundred twelve million, one hundred twenty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •