Base | Representation |
---|---|
bin | 1011111100010101111001… |
… | …1111000000110110100100 |
3 | 1201111100011220000101122012 |
4 | 2333011132133000312210 |
5 | 3210120400323242012 |
6 | 43532234103453352 |
7 | 2523463601111564 |
oct | 277053637006644 |
9 | 51440156011565 |
10 | 13131300212132 |
11 | 4202a53701503 |
12 | 1580b25a57258 |
13 | 74337904062b |
14 | 3357b6068da4 |
15 | 17b89672d622 |
hex | bf15e7c0da4 |
13131300212132 has 12 divisors (see below), whose sum is σ = 23190598999260. Its totient is φ = 6505414783776.
The previous prime is 13131300212083. The next prime is 13131300212183. The reversal of 13131300212132 is 23121200313131.
It can be written as a sum of positive squares in 2 ways, for example, as 4066901422336 + 9064398789796 = 2016656^2 + 3010714^2 .
It is a super-2 number, since 2×131313002121322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13131300212098 and 13131300212107.
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, 15058830083 + ... + 15058830954.
It is an arithmetic number, because the mean of its divisors is an integer number (1932549916605).
Almost surely, 213131300212132 is an apocalyptic number.
It is an amenable number.
13131300212132 is a deficient number, since it is larger than the sum of its proper divisors (10059298787128).
13131300212132 is a wasteful number, since it uses less digits than its factorization.
13131300212132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30117661150 (or 30117661148 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13131300212132 its reverse (23121200313131), we get a palindrome (36252500525263).
The spelling of 13131300212132 in words is "thirteen trillion, one hundred thirty-one billion, three hundred million, two hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •