Base | Representation |
---|---|
bin | 111011110010100001101… |
… | …100011000011111011001 |
3 | 112112210021110202010002112 |
4 | 323302201230120133121 |
5 | 1014304110041021101 |
6 | 12423302244242105 |
7 | 602562311345300 |
oct | 73624154303731 |
9 | 15483243663075 |
10 | 4108701501401 |
11 | 134454397a542 |
12 | 5643639a0335 |
13 | 23a5ab294b73 |
14 | 102c0dcb3437 |
15 | 71d240ac6bb |
hex | 3bca1b187d9 |
4108701501401 has 48 divisors (see below), whose sum is σ = 5015285320320. Its totient is φ = 3353278199040.
The previous prime is 4108701501397. The next prime is 4108701501413. The reversal of 4108701501401 is 1041051078014.
It is not a de Polignac number, because 4108701501401 - 22 = 4108701501397 is a prime.
It is a super-2 number, since 2×41087015014012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4108701501431) 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 47 ways as a sum of consecutive naturals, for example, 13159835 + ... + 13468431.
It is an arithmetic number, because the mean of its divisors is an integer number (104485110840).
Almost surely, 24108701501401 is an apocalyptic number.
It is an amenable number.
4108701501401 is a deficient number, since it is larger than the sum of its proper divisors (906583818919).
4108701501401 is a wasteful number, since it uses less digits than its factorization.
4108701501401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308814 (or 308807 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 32.
Adding to 4108701501401 its reverse (1041051078014), we get a palindrome (5149752579415).
The spelling of 4108701501401 in words is "four trillion, one hundred eight billion, seven hundred one million, five hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •