Base | Representation |
---|---|
bin | 11110000101001101111110… |
… | …101011101100010001010111 |
3 | 122100102202102200102122200010 |
4 | 132011031332223230101113 |
5 | 114320100401232021211 |
6 | 1145213440552251303 |
7 | 36603234256512546 |
oct | 3605157653542127 |
9 | 570382380378603 |
10 | 132300003001431 |
11 | 39178130705331 |
12 | 12a087633a0b33 |
13 | 58a8ab5459345 |
14 | 24954d633215d |
15 | 10466601294a6 |
hex | 78537eaec457 |
132300003001431 has 16 divisors (see below), whose sum is σ = 176494778548704. Its totient is φ = 88152626817024.
The previous prime is 132300003001391. The next prime is 132300003001457. The reversal of 132300003001431 is 134100300003231.
It is not a de Polignac number, because 132300003001431 - 213 = 132300002993239 is a prime.
It is a super-2 number, since 2×1323000030014312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132300003001398 and 132300003001407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132300003001931) 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, 42380431 + ... + 45394943.
It is an arithmetic number, because the mean of its divisors is an integer number (11030923659294).
Almost surely, 2132300003001431 is an apocalyptic number.
132300003001431 is a deficient number, since it is larger than the sum of its proper divisors (44194775547273).
132300003001431 is a wasteful number, since it uses less digits than its factorization.
132300003001431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3022370.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 132300003001431 its reverse (134100300003231), we get a palindrome (266400303004662).
The spelling of 132300003001431 in words is "one hundred thirty-two trillion, three hundred billion, three million, one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •