Base | Representation |
---|---|
bin | 100110111001100000111100… |
… | …1101000000011001010100001 |
3 | 1122212110211020220100220001202 |
4 | 1031303001321220003022201 |
5 | 324321342113143213101 |
6 | 3211412235151010545 |
7 | 132032656312441226 |
oct | 11563017150031241 |
9 | 1585424226326052 |
10 | 342156315210401 |
11 | 9a026750a3757a |
12 | 32460229809a55 |
13 | 118bc281c73c83 |
14 | 606c64db7394d |
15 | 298540e78636b |
hex | 1373079a032a1 |
342156315210401 has 16 divisors (see below), whose sum is σ = 358522673063808. Its totient is φ = 325914188371200.
The previous prime is 342156315210397. The next prime is 342156315210407. The reversal of 342156315210401 is 104012513651243.
It is a cyclic number.
It is not a de Polignac number, because 342156315210401 - 22 = 342156315210397 is a prime.
It is a super-3 number, since 3×3421563152104013 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (342156315210407) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 239249075 + ... + 240674951.
It is an arithmetic number, because the mean of its divisors is an integer number (22407667066488).
Almost surely, 2342156315210401 is an apocalyptic number.
It is an amenable number.
342156315210401 is a deficient number, since it is larger than the sum of its proper divisors (16366357853407).
342156315210401 is a wasteful number, since it uses less digits than its factorization.
342156315210401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1469432.
The product of its (nonzero) digits is 86400, while the sum is 38.
Adding to 342156315210401 its reverse (104012513651243), we get a palindrome (446168828861644).
The spelling of 342156315210401 in words is "three hundred forty-two trillion, one hundred fifty-six billion, three hundred fifteen million, two hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •