Base | Representation |
---|---|
bin | 10100100010101100011… |
… | …111010010011101110101 |
3 | 11222221200211122102100111 |
4 | 110202230133102131311 |
5 | 141112021122000331 |
6 | 3000255551543021 |
7 | 203662555564165 |
oct | 24425437223565 |
9 | 4887624572314 |
10 | 1411643156341 |
11 | 4a474683aa50 |
12 | 1a970452aa71 |
13 | a316ab5a4b2 |
14 | 4c476a985a5 |
15 | 26ac03e3db1 |
hex | 148ac7d2775 |
1411643156341 has 8 divisors (see below), whose sum is σ = 1589650944768. Its totient is φ = 1241914800000.
The previous prime is 1411643156321. The next prime is 1411643156383. The reversal of 1411643156341 is 1436513461141.
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 1411643156341 - 25 = 1411643156309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1411643156294 and 1411643156303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1411643156311) 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, 2069857660 + ... + 2069858341.
It is an arithmetic number, because the mean of its divisors is an integer number (198706368096).
Almost surely, 21411643156341 is an apocalyptic number.
1411643156341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1411643156341 is a deficient number, since it is larger than the sum of its proper divisors (178007788427).
1411643156341 is a wasteful number, since it uses less digits than its factorization.
1411643156341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4139716043.
The product of its digits is 103680, while the sum is 40.
The spelling of 1411643156341 in words is "one trillion, four hundred eleven billion, six hundred forty-three million, one hundred fifty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •