Base | Representation |
---|---|
bin | 11110001101000000111001… |
… | …010100001100001001000101 |
3 | 122102022222012000220011111102 |
4 | 132031000321110030021011 |
5 | 114402340013242441423 |
6 | 1150303514403145445 |
7 | 36660030505105166 |
oct | 3615007124141105 |
9 | 572288160804442 |
10 | 132835710124613 |
11 | 39364343388991 |
12 | 12a9454a675285 |
13 | 591747a162472 |
14 | 24b33d593176d |
15 | 105556591ac28 |
hex | 78d03950c245 |
132835710124613 has 32 divisors (see below), whose sum is σ = 140886917015040. Its totient is φ = 125089954007040.
The previous prime is 132835710124609. The next prime is 132835710124631. The reversal of 132835710124613 is 316421017538231.
It is a cyclic number.
It is not a de Polignac number, because 132835710124613 - 22 = 132835710124609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132835710124603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1915763681 + ... + 1915833017.
It is an arithmetic number, because the mean of its divisors is an integer number (4402716156720).
Almost surely, 2132835710124613 is an apocalyptic number.
It is an amenable number.
132835710124613 is a deficient number, since it is larger than the sum of its proper divisors (8051206890427).
132835710124613 is a wasteful number, since it uses less digits than its factorization.
132835710124613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83117.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 132835710124613 in words is "one hundred thirty-two trillion, eight hundred thirty-five billion, seven hundred ten million, one hundred twenty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •