Base | Representation |
---|---|
bin | 111101100111101111… |
… | …1110001000101010111 |
3 | 110122120022200012101110 |
4 | 1323033133301011113 |
5 | 4132003014330403 |
6 | 140443000030103 |
7 | 12363160253061 |
oct | 1731737610527 |
9 | 418508605343 |
10 | 132330230103 |
11 | 51136a68535 |
12 | 21791162333 |
13 | c62b8a2606 |
14 | 6594b66731 |
15 | 3697707103 |
hex | 1ecf7f1157 |
132330230103 has 4 divisors (see below), whose sum is σ = 176440306808. Its totient is φ = 88220153400.
The previous prime is 132330230093. The next prime is 132330230119. The reversal of 132330230103 is 301032033231.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 132330230103 - 28 = 132330229847 is a prime.
It is a super-2 number, since 2×1323302301032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132330230103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132330230203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22055038348 + ... + 22055038353.
It is an arithmetic number, because the mean of its divisors is an integer number (44110076702).
Almost surely, 2132330230103 is an apocalyptic number.
132330230103 is a deficient number, since it is larger than the sum of its proper divisors (44110076705).
132330230103 is an equidigital number, since it uses as much as digits as its factorization.
132330230103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44110076704.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 132330230103 its reverse (301032033231), we get a palindrome (433362263334).
The spelling of 132330230103 in words is "one hundred thirty-two billion, three hundred thirty million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •