Base | Representation |
---|---|
bin | 11110000100000011110000… |
… | …010001011101110000010110 |
3 | 122100011010201100100200111210 |
4 | 132010003300101131300112 |
5 | 114312244140403201410 |
6 | 1145113100321442250 |
7 | 36564413254246065 |
oct | 3604036021356026 |
9 | 570133640320453 |
10 | 132220304350230 |
11 | 39147352914048 |
12 | 129b52204a0386 |
13 | 58a14238a5235 |
14 | 24916d55dc1dc |
15 | 1044548334220 |
hex | 7840f045dc16 |
132220304350230 has 32 divisors (see below), whose sum is σ = 317329237603584. Its totient is φ = 35258691475296.
The previous prime is 132220304350223. The next prime is 132220304350247. The reversal of 132220304350230 is 32053403022231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
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, 17647689 + ... + 23997531.
It is an arithmetic number, because the mean of its divisors is an integer number (9916538675112).
Almost surely, 2132220304350230 is an apocalyptic number.
132220304350230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132220304350230 is an abundant number, since it is smaller than the sum of its proper divisors (185108933253354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132220304350230 is a wasteful number, since it uses less digits than its factorization.
132220304350230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7043940.
The product of its (nonzero) digits is 25920, while the sum is 30.
Adding to 132220304350230 its reverse (32053403022231), we get a palindrome (164273707372461).
The spelling of 132220304350230 in words is "one hundred thirty-two trillion, two hundred twenty billion, three hundred four million, three hundred fifty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •