Base | Representation |
---|---|
bin | 111011110110110101001… |
… | …110001111010111000101 |
3 | 112120020012122000000202121 |
4 | 323312311032033113011 |
5 | 1014343041433030201 |
6 | 12425345055005541 |
7 | 603115002030136 |
oct | 73666516172705 |
9 | 15506178000677 |
10 | 4113324111301 |
11 | 13464a62547a9 |
12 | 565233b098b1 |
13 | 23ab66b9a4b2 |
14 | 10312bbb7c8d |
15 | 71ee4d199a1 |
hex | 3bdb538f5c5 |
4113324111301 has 8 divisors (see below), whose sum is σ = 4211925678720. Its totient is φ = 4015184378688.
The previous prime is 4113324111289. The next prime is 4113324111317. The reversal of 4113324111301 is 1031114233114.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4113324111301 - 221 = 4113322014149 is a prime.
It is a super-2 number, since 2×41133241113012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4113324181301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115440676 + ... + 115476301.
It is an arithmetic number, because the mean of its divisors is an integer number (526490709840).
Almost surely, 24113324111301 is an apocalyptic number.
It is an amenable number.
4113324111301 is a deficient number, since it is larger than the sum of its proper divisors (98601567419).
4113324111301 is a wasteful number, since it uses less digits than its factorization.
4113324111301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230917403.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 4113324111301 its reverse (1031114233114), we get a palindrome (5144438344415).
The spelling of 4113324111301 in words is "four trillion, one hundred thirteen billion, three hundred twenty-four million, one hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •