Base | Representation |
---|---|
bin | 111101100111101111… |
… | …1010001010111111111 |
3 | 110122120022102121020002 |
4 | 1323033133101113333 |
5 | 4132003001201343 |
6 | 140442553144515 |
7 | 12363156202316 |
oct | 1731737212777 |
9 | 418508377202 |
10 | 132330100223 |
11 | 511369899a2 |
12 | 217910bb13b |
13 | c62b858469 |
14 | 6594b3127d |
15 | 36976cd8b8 |
hex | 1ecf7d15ff |
132330100223 has 8 divisors (see below), whose sum is σ = 139378636800. Its totient is φ = 125289943128.
The previous prime is 132330100181. The next prime is 132330100271. The reversal of 132330100223 is 322001033231.
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 132330100223 - 228 = 132061664767 is a prime.
It is a super-2 number, since 2×1323301002232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132330100195 and 132330100204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132330100423) 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, 2062433 + ... + 2125626.
It is an arithmetic number, because the mean of its divisors is an integer number (17422329600).
Almost surely, 2132330100223 is an apocalyptic number.
132330100223 is a deficient number, since it is larger than the sum of its proper divisors (7048536577).
132330100223 is a wasteful number, since it uses less digits than its factorization.
132330100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4189741.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 132330100223 its reverse (322001033231), we get a palindrome (454331133454).
The spelling of 132330100223 in words is "one hundred thirty-two billion, three hundred thirty million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •