Base | Representation |
---|---|
bin | 110000100100011110… |
… | …1010000010101001010 |
3 | 100222020001221012020220 |
4 | 1201020331100111022 |
5 | 3202103111413310 |
6 | 115525524130510 |
7 | 10351505563233 |
oct | 1411075202512 |
9 | 328201835226 |
10 | 104303232330 |
11 | 40264501260 |
12 | 1826ab36a36 |
13 | 9ab31c126b |
14 | 509678a08a |
15 | 2aa6e0b670 |
hex | 1848f5054a |
104303232330 has 32 divisors (see below), whose sum is σ = 273084827328. Its totient is φ = 25285632000.
The previous prime is 104303232269. The next prime is 104303232337. The reversal of 104303232330 is 33232303401.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 104303232330.
It is not an unprimeable number, because it can be changed into a prime (104303232337) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 158034871 + ... + 158035530.
It is an arithmetic number, because the mean of its divisors is an integer number (8533900854).
Almost surely, 2104303232330 is an apocalyptic number.
104303232330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104303232330 is an abundant number, since it is smaller than the sum of its proper divisors (168781594998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104303232330 is a wasteful number, since it uses less digits than its factorization.
104303232330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316070422.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 104303232330 its reverse (33232303401), we get a palindrome (137535535731).
It can be divided in two parts, 104303 and 232330, that added together give a palindrome (336633).
The spelling of 104303232330 in words is "one hundred four billion, three hundred three million, two hundred thirty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •