Base | Representation |
---|---|
bin | 111100000111011110110… |
… | …011001101000101010111 |
3 | 112121221100112112022120000 |
4 | 330013132303031011113 |
5 | 1020141200043130333 |
6 | 12441503042142343 |
7 | 604320011444640 |
oct | 74073663150527 |
9 | 15557315468500 |
10 | 4131201536343 |
11 | 135303a626842 |
12 | 5687a30519b3 |
13 | 23c7558b1acb |
14 | 103d462186c7 |
15 | 726de55e713 |
hex | 3c1deccd157 |
4131201536343 has 80 divisors (see below), whose sum is σ = 7469570110464. Its totient is φ = 2221293922560.
The previous prime is 4131201536317. The next prime is 4131201536353. The reversal of 4131201536343 is 3436351021314.
4131201536343 is a `hidden beast` number, since 4 + 1 + 3 + 1 + 2 + 0 + 15 + 3 + 634 + 3 = 666.
It is not a de Polignac number, because 4131201536343 - 28 = 4131201536087 is a prime.
It is a super-2 number, since 2×41312015363432 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4131201536298 and 4131201536307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4131201536353) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 42276046 + ... + 42373652.
Almost surely, 24131201536343 is an apocalyptic number.
4131201536343 is a deficient number, since it is larger than the sum of its proper divisors (3338368574121).
4131201536343 is a wasteful number, since it uses less digits than its factorization.
4131201536343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102034 (or 102025 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
Adding to 4131201536343 its reverse (3436351021314), we get a palindrome (7567552557657).
The spelling of 4131201536343 in words is "four trillion, one hundred thirty-one billion, two hundred one million, five hundred thirty-six thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •