Base | Representation |
---|---|
bin | 11101110010111110010011… |
… | …001000100001100101110100 |
3 | 122011222220012002100011202102 |
4 | 131302332103020201211310 |
5 | 114134030122201404443 |
6 | 1142413444514201232 |
7 | 36413530250062013 |
oct | 3562762310414564 |
9 | 564886162304672 |
10 | 131046215653748 |
11 | 3883442a40688a |
12 | 12845774583218 |
13 | 58177b35773b5 |
14 | 24509564baa7a |
15 | 1023c2d32bcb8 |
hex | 772f93221974 |
131046215653748 has 12 divisors (see below), whose sum is σ = 229450757636100. Its totient is φ = 65488856329152.
The previous prime is 131046215653723. The next prime is 131046215653799. The reversal of 131046215653748 is 847356512640131.
It can be written as a sum of positive squares in 2 ways, for example, as 60985666286224 + 70060549367524 = 7809332^2 + 8370218^2 .
It is a super-2 number, since 2×1310462156537482 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131046215653693 and 131046215653702.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8562865823 + ... + 8562881126.
It is an arithmetic number, because the mean of its divisors is an integer number (19120896469675).
Almost surely, 2131046215653748 is an apocalyptic number.
It is an amenable number.
131046215653748 is a deficient number, since it is larger than the sum of its proper divisors (98404541982352).
131046215653748 is a wasteful number, since it uses less digits than its factorization.
131046215653748 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17125748866 (or 17125748864 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 56.
The spelling of 131046215653748 in words is "one hundred thirty-one trillion, forty-six billion, two hundred fifteen million, six hundred fifty-three thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •