Base | Representation |
---|---|
bin | 100110111100001111111100… |
… | …0111001000010100001100011 |
3 | 1122220210202020212022110211012 |
4 | 1031320133320321002201203 |
5 | 324344021231301303121 |
6 | 3212301025151411135 |
7 | 132102062031062354 |
oct | 11570377071024143 |
9 | 1586722225273735 |
10 | 342532112525411 |
11 | 9a1610647aa476 |
12 | 32501027523aab |
13 | 119188412cb823 |
14 | 60828dd819d2b |
15 | 29900a64a3c5b |
hex | 13787f8e42863 |
342532112525411 has 4 divisors (see below), whose sum is σ = 344800537111824. Its totient is φ = 340263687939000.
The previous prime is 342532112525381. The next prime is 342532112525513. The reversal of 342532112525411 is 114525211235243.
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-342532112525411 is a prime.
It is a super-3 number, since 3×3425321125254113 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (342532112225411) 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, 1134212292980 + ... + 1134212293281.
It is an arithmetic number, because the mean of its divisors is an integer number (86200134277956).
Almost surely, 2342532112525411 is an apocalyptic number.
342532112525411 is a deficient number, since it is larger than the sum of its proper divisors (2268424586413).
342532112525411 is a wasteful number, since it uses less digits than its factorization.
342532112525411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2268424586412.
The product of its digits is 288000, while the sum is 41.
The spelling of 342532112525411 in words is "three hundred forty-two trillion, five hundred thirty-two billion, one hundred twelve million, five hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •