Base | Representation |
---|---|
bin | 111010011001100010110… |
… | …101101111111010111001 |
3 | 112012122122212020200221222 |
4 | 322121202311233322321 |
5 | 1011222421333232140 |
6 | 12311341425241425 |
7 | 562640534466143 |
oct | 72314265577271 |
9 | 15178585220858 |
10 | 4013157711545 |
11 | 1307a749a6044 |
12 | 54993a493275 |
13 | 231592a69378 |
14 | dc3489ddc93 |
15 | 6e5d11b15b5 |
hex | 3a662d6feb9 |
4013157711545 has 4 divisors (see below), whose sum is σ = 4815789253860. Its totient is φ = 3210526169232.
The previous prime is 4013157711473. The next prime is 4013157711581. The reversal of 4013157711545 is 5451177513104.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 419846977936 + 3593310733609 = 647956^2 + 1895603^2 .
It is a cyclic number.
It is not a de Polignac number, because 4013157711545 - 28 = 4013157711289 is a prime.
It is a super-2 number, since 2×40131577115452 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4013157711496 and 4013157711505.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 401315771150 + ... + 401315771159.
It is an arithmetic number, because the mean of its divisors is an integer number (1203947313465).
Almost surely, 24013157711545 is an apocalyptic number.
It is an amenable number.
4013157711545 is a deficient number, since it is larger than the sum of its proper divisors (802631542315).
4013157711545 is an equidigital number, since it uses as much as digits as its factorization.
4013157711545 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 802631542314.
The product of its (nonzero) digits is 294000, while the sum is 44.
The spelling of 4013157711545 in words is "four trillion, thirteen billion, one hundred fifty-seven million, seven hundred eleven thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •