Base | Representation |
---|---|
bin | 1110100110010010101100… |
… | …00111010100110011111101 |
3 | 11012122220221200121110102021 |
4 | 13103021112013110303331 |
5 | 13201424424231044013 |
6 | 152135245200200141 |
7 | 6522203144402440 |
oct | 723112607246375 |
9 | 135586850543367 |
10 | 32102030331133 |
11 | a257438250854 |
12 | 3725709009051 |
13 | 14bb29301a009 |
14 | 7cda647ad657 |
15 | 3aa0aa395a8d |
hex | 1d32561d4cfd |
32102030331133 has 8 divisors (see below), whose sum is σ = 37468631146752. Its totient is φ = 26930578636176.
The previous prime is 32102030331131. The next prime is 32102030331179. The reversal of 32102030331133 is 33113303020123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32102030331133 - 21 = 32102030331131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32102030331098 and 32102030331107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32102030331131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48787279810 + ... + 48787280467.
It is an arithmetic number, because the mean of its divisors is an integer number (4683578893344).
Almost surely, 232102030331133 is an apocalyptic number.
It is an amenable number.
32102030331133 is a deficient number, since it is larger than the sum of its proper divisors (5366600815619).
32102030331133 is an equidigital number, since it uses as much as digits as its factorization.
32102030331133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97574560331.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 32102030331133 its reverse (33113303020123), we get a palindrome (65215333351256).
The spelling of 32102030331133 in words is "thirty-two trillion, one hundred two billion, thirty million, three hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •