Base | Representation |
---|---|
bin | 110100110000001100010001… |
… | …100011111111011001110000 |
3 | 1010102110221201002012220121110 |
4 | 310300030101203333121300 |
5 | 220402223223022310112 |
6 | 2141235552251153320 |
7 | 66604115244462306 |
oct | 6460142143773160 |
9 | 1112427632186543 |
10 | 232010133010032 |
11 | 67a1aa43657643 |
12 | 22031150145840 |
13 | 9c5c600380500 |
14 | 41414c9528276 |
15 | 1bc51b172913c |
hex | d303118ff670 |
232010133010032 has 120 divisors (see below), whose sum is σ = 664840121602608. Its totient is φ = 69646568908800.
The previous prime is 232010133009989. The next prime is 232010133010081. The reversal of 232010133010032 is 230010331010232.
It is a super-2 number, since 2×2320101330100322 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 232010133009990 and 232010133010008.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 348458319 + ... + 349123502.
Almost surely, 2232010133010032 is an apocalyptic number.
It is an amenable number.
232010133010032 is an abundant number, since it is smaller than the sum of its proper divisors (432829988592576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232010133010032 is a wasteful number, since it uses less digits than its factorization.
232010133010032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 697581899 (or 697581880 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 232010133010032 its reverse (230010331010232), we get a palindrome (462020464020264).
The spelling of 232010133010032 in words is "two hundred thirty-two trillion, ten billion, one hundred thirty-three million, ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •