Base | Representation |
---|---|
bin | 1100011011001… |
… | …01111001111110 |
3 | 21021010020210011 |
4 | 12031211321332 |
5 | 203140221210 |
6 | 14201533434 |
7 | 2403624100 |
oct | 615457176 |
9 | 237106704 |
10 | 104226430 |
11 | 53918950 |
12 | 2aaa427a |
13 | 18793459 |
14 | dbb1570 |
15 | 923bd8a |
hex | 6365e7e |
104226430 has 96 divisors (see below), whose sum is σ = 242743392. Its totient is φ = 31852800.
The previous prime is 104226413. The next prime is 104226467. The reversal of 104226430 is 34622401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 328632 + ... + 328948.
It is an arithmetic number, because the mean of its divisors is an integer number (2528577).
Almost surely, 2104226430 is an apocalyptic number.
104226430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104226430 is an abundant number, since it is smaller than the sum of its proper divisors (138516962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104226430 is a wasteful number, since it uses less digits than its factorization.
104226430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410 (or 403 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 104226430 is about 10209.1346352176. The cubic root of 104226430 is about 470.6079803572.
Adding to 104226430 its reverse (34622401), we get a palindrome (138848831).
It can be divided in two parts, 1042 and 26430, that added together give a palindrome (27472).
The spelling of 104226430 in words is "one hundred four million, two hundred twenty-six thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •