Base | Representation |
---|---|
bin | 111101011110001111… |
… | …0011101101001001110 |
3 | 110121202002012210022022 |
4 | 1322330132131221032 |
5 | 4130324321334410 |
6 | 140351200250142 |
7 | 12352234005362 |
oct | 1727436355116 |
9 | 417662183268 |
10 | 132011121230 |
11 | 50a9292229a |
12 | 21702310952 |
13 | c5aa743bb1 |
14 | 656461b2a2 |
15 | 36796c1455 |
hex | 1ebc79da4e |
132011121230 has 8 divisors (see below), whose sum is σ = 237620018232. Its totient is φ = 52804448488.
The previous prime is 132011121223. The next prime is 132011121247. The reversal of 132011121230 is 32121110231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1320111212302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132011121199 and 132011121208.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 6600556052 + ... + 6600556071.
It is an arithmetic number, because the mean of its divisors is an integer number (29702502279).
Almost surely, 2132011121230 is an apocalyptic number.
132011121230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132011121230 is a deficient number, since it is larger than the sum of its proper divisors (105608897002).
132011121230 is a wasteful number, since it uses less digits than its factorization.
132011121230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13201112130.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132011121230 its reverse (32121110231), we get a palindrome (164132231461).
The spelling of 132011121230 in words is "one hundred thirty-two billion, eleven million, one hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •