Base | Representation |
---|---|
bin | 111101011110001101… |
… | …1011010110110000010 |
3 | 110121202000201020210110 |
4 | 1322330123122312002 |
5 | 4130324120321310 |
6 | 140351131212150 |
7 | 12352224143214 |
oct | 1727433326602 |
9 | 417660636713 |
10 | 132010323330 |
11 | 50a92427876 |
12 | 21701ba7056 |
13 | c5aa524972 |
14 | 65644905b4 |
15 | 36795b4d20 |
hex | 1ebc6dad82 |
132010323330 has 32 divisors (see below), whose sum is σ = 317105481600. Its totient is φ = 35171563392.
The previous prime is 132010323283. The next prime is 132010323377. The reversal of 132010323330 is 33323010231.
It is an interprime number because it is at equal distance from previous prime (132010323283) and next prime (132010323377).
It is a super-2 number, since 2×1320103233302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132010323297 and 132010323306.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1914910 + ... + 1982649.
It is an arithmetic number, because the mean of its divisors is an integer number (9909546300).
Almost surely, 2132010323330 is an apocalyptic number.
132010323330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132010323330 is an abundant number, since it is smaller than the sum of its proper divisors (185095158270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132010323330 is a wasteful number, since it uses less digits than its factorization.
132010323330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3898698.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 132010323330 its reverse (33323010231), we get a palindrome (165333333561).
The spelling of 132010323330 in words is "one hundred thirty-two billion, ten million, three hundred twenty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •