Base | Representation |
---|---|
bin | 1001101010100110111… |
… | …10101011001110100111 |
3 | 1011202020112021002020111 |
4 | 10311103132223032213 |
5 | 20420131414011403 |
6 | 412323130513451 |
7 | 32665033123546 |
oct | 4652336531647 |
9 | 1152215232214 |
10 | 332113032103 |
11 | 11893716a656 |
12 | 54447b95887 |
13 | 25419bc5558 |
14 | 1210806a15d |
15 | 898ba7656d |
hex | 4d537ab3a7 |
332113032103 has 8 divisors (see below), whose sum is σ = 332305914096. Its totient is φ = 331920211200.
The previous prime is 332113032079. The next prime is 332113032113. The reversal of 332113032103 is 301230311233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-332113032103 is a prime.
It is a super-2 number, since 2×3321130321032 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332113032113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 14624988 + ... + 14647678.
It is an arithmetic number, because the mean of its divisors is an integer number (41538239262).
Almost surely, 2332113032103 is an apocalyptic number.
332113032103 is a deficient number, since it is larger than the sum of its proper divisors (192881993).
332113032103 is a wasteful number, since it uses less digits than its factorization.
332113032103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30545.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 332113032103 its reverse (301230311233), we get a palindrome (633343343336).
The spelling of 332113032103 in words is "three hundred thirty-two billion, one hundred thirteen million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •