Base | Representation |
---|---|
bin | 111100001011011100010… |
… | …111011000100011000011 |
3 | 112122100100000101222211011 |
4 | 330023130113120203003 |
5 | 1020223403121444011 |
6 | 12443445130501351 |
7 | 604530306042352 |
oct | 74133427304303 |
9 | 15570300358734 |
10 | 4135455656131 |
11 | 13549229a7a18 |
12 | 56958b894857 |
13 | 23cc83059157 |
14 | 10422b1db999 |
15 | 7288cc7e621 |
hex | 3c2dc5d88c3 |
4135455656131 has 4 divisors (see below), whose sum is σ = 4353111217000. Its totient is φ = 3917800095264.
The previous prime is 4135455656069. The next prime is 4135455656161. The reversal of 4135455656131 is 1316565545314.
4135455656131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4135455656131 is a prime.
It is a super-2 number, since 2×41354556561312 (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 (4135455656161) 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, 108827780406 + ... + 108827780443.
It is an arithmetic number, because the mean of its divisors is an integer number (1088277804250).
Almost surely, 24135455656131 is an apocalyptic number.
4135455656131 is a deficient number, since it is larger than the sum of its proper divisors (217655560869).
4135455656131 is a wasteful number, since it uses less digits than its factorization.
4135455656131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217655560868.
The product of its digits is 3240000, while the sum is 49.
The spelling of 4135455656131 in words is "four trillion, one hundred thirty-five billion, four hundred fifty-five million, six hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •