Base | Representation |
---|---|
bin | 101111111110100110… |
… | …1001010010000010010 |
3 | 100211221111111211120120 |
4 | 1133331031022100102 |
5 | 3142002234131310 |
6 | 115155444251110 |
7 | 10305144245313 |
oct | 1377515122022 |
9 | 324844454516 |
10 | 103032333330 |
11 | 3a772080003 |
12 | 17b753a0a96 |
13 | 993cb05014 |
14 | 4db5a8260a |
15 | 2a30568b70 |
hex | 17fd34a412 |
103032333330 has 64 divisors (see below), whose sum is σ = 263580739200. Its totient is φ = 25685525504.
The previous prime is 103032333311. The next prime is 103032333359. The reversal of 103032333330 is 33333230301.
It is a happy number.
It is a super-2 number, since 2×1030323333302 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103032333330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 601944 + ... + 753923.
It is an arithmetic number, because the mean of its divisors is an integer number (4118449050).
Almost surely, 2103032333330 is an apocalyptic number.
103032333330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103032333330 is an abundant number, since it is smaller than the sum of its proper divisors (160548405870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032333330 is a wasteful number, since it uses less digits than its factorization.
103032333330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356043.
The product of its (nonzero) digits is 4374, while the sum is 24.
Adding to 103032333330 its reverse (33333230301), we get a palindrome (136365563631).
The spelling of 103032333330 in words is "one hundred three billion, thirty-two million, three hundred thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •