Base | Representation |
---|---|
bin | 110001000000110101… |
… | …0000100011111101110 |
3 | 101001200100220211020220 |
4 | 1202001222010133232 |
5 | 3211030123120210 |
6 | 120204145152210 |
7 | 10414206345255 |
oct | 1420152043756 |
9 | 331610824226 |
10 | 105254504430 |
11 | 40702473049 |
12 | 1849562b666 |
13 | 9c052ca06a |
14 | 5146c5179c |
15 | 2b106b4c70 |
hex | 1881a847ee |
105254504430 has 64 divisors (see below), whose sum is σ = 263075688000. Its totient is φ = 26918097920.
The previous prime is 105254504393. The next prime is 105254504441. The reversal of 105254504430 is 34405452501.
It is a super-2 number, since 2×1052545044302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105254504391 and 105254504400.
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 31 ways as a sum of consecutive naturals, for example, 276351 + ... + 535610.
It is an arithmetic number, because the mean of its divisors is an integer number (4110557625).
Almost surely, 2105254504430 is an apocalyptic number.
105254504430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105254504430 is an abundant number, since it is smaller than the sum of its proper divisors (157821183570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105254504430 is a wasteful number, since it uses less digits than its factorization.
105254504430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812149.
The product of its (nonzero) digits is 48000, while the sum is 33.
Adding to 105254504430 its reverse (34405452501), we get a palindrome (139659956931).
The spelling of 105254504430 in words is "one hundred five billion, two hundred fifty-four million, five hundred four thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •