Base | Representation |
---|---|
bin | 111011111101000011001… |
… | …010110011110101110001 |
3 | 112120212102220212221210221 |
4 | 323331003022303311301 |
5 | 1020000230114402423 |
6 | 12432411354053041 |
7 | 603442311542626 |
oct | 73750312636561 |
9 | 15525386787727 |
10 | 4120000544113 |
11 | 1349311998573 |
12 | 566597a1a181 |
13 | 23b68c14365c |
14 | 1035a278834d |
15 | 7228601be5d |
hex | 3bf432b3d71 |
4120000544113 has 4 divisors (see below), whose sum is σ = 4120481692528. Its totient is φ = 4119519395700.
The previous prime is 4120000544089. The next prime is 4120000544117. The reversal of 4120000544113 is 3114450000214.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4120000544113 is a prime.
It is a super-3 number, since 3×41200005441133 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4120000544117) 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, 240561363 + ... + 240578488.
It is an arithmetic number, because the mean of its divisors is an integer number (1030120423132).
Almost surely, 24120000544113 is an apocalyptic number.
It is an amenable number.
4120000544113 is a deficient number, since it is larger than the sum of its proper divisors (481148415).
4120000544113 is an equidigital number, since it uses as much as digits as its factorization.
4120000544113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481148414.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 4120000544113 its reverse (3114450000214), we get a palindrome (7234450544327).
The spelling of 4120000544113 in words is "four trillion, one hundred twenty billion, five hundred forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •