Base | Representation |
---|---|
bin | 1001101010011101000… |
… | …10000000101010000110 |
3 | 1011202000202001122100200 |
4 | 10311032202000222012 |
5 | 20414444141121410 |
6 | 412311003351330 |
7 | 32663004414456 |
oct | 4651642005206 |
9 | 1152022048320 |
10 | 332030020230 |
11 | 1188a43215a7 |
12 | 54424222546 |
13 | 2540594c2bc |
14 | 120db01bd66 |
15 | 898462a3c0 |
hex | 4d4e880a86 |
332030020230 has 48 divisors (see below), whose sum is σ = 869579384544. Its totient is φ = 87895048320.
The previous prime is 332030020151. The next prime is 332030020249. The reversal of 332030020230 is 32020030233.
332030020230 is a `hidden beast` number, since 3 + 320 + 300 + 20 + 23 + 0 = 666.
It is a super-2 number, since 2×3320300202302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13451986 + ... + 13476645.
It is an arithmetic number, because the mean of its divisors is an integer number (18116237178).
Almost surely, 2332030020230 is an apocalyptic number.
332030020230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
332030020230 is an abundant number, since it is smaller than the sum of its proper divisors (537549364314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
332030020230 is a wasteful number, since it uses less digits than its factorization.
332030020230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26928781 (or 26928778 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 18.
Adding to 332030020230 its reverse (32020030233), we get a palindrome (364050050463).
The spelling of 332030020230 in words is "three hundred thirty-two billion, thirty million, twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •