Base | Representation |
---|---|
bin | 1110100111001100101111… |
… | …11111000011011110011101 |
3 | 11012202220101222021101202012 |
4 | 13103212113333003132131 |
5 | 13202432243224332201 |
6 | 152201442143241005 |
7 | 6524355441231152 |
oct | 723462777033635 |
9 | 135686358241665 |
10 | 32133200230301 |
11 | a2696829013a5 |
12 | 372b7678a9165 |
13 | 14c11bc897731 |
14 | 7d1380350229 |
15 | 3aacd1a615bb |
hex | 1d3997fc379d |
32133200230301 has 32 divisors (see below), whose sum is σ = 34298205511680. Its totient is φ = 30034307343744.
The previous prime is 32133200230291. The next prime is 32133200230343. The reversal of 32133200230301 is 10303200233123.
It is a de Polignac number, because none of the positive numbers 2k-32133200230301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32133200238301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1991019890 + ... + 1991036028.
It is an arithmetic number, because the mean of its divisors is an integer number (1071818922240).
Almost surely, 232133200230301 is an apocalyptic number.
It is an amenable number.
32133200230301 is a deficient number, since it is larger than the sum of its proper divisors (2165005281379).
32133200230301 is a wasteful number, since it uses less digits than its factorization.
32133200230301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19025.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 32133200230301 its reverse (10303200233123), we get a palindrome (42436400463424).
The spelling of 32133200230301 in words is "thirty-two trillion, one hundred thirty-three billion, two hundred million, two hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •