Base | Representation |
---|---|
bin | 110001000001010011… |
… | …1100111001110001010 |
3 | 101001201111021110121011 |
4 | 1202002213213032022 |
5 | 3211043240344300 |
6 | 120205523034134 |
7 | 10414463440306 |
oct | 1420247471612 |
9 | 331644243534 |
10 | 105270637450 |
11 | 40710592020 |
12 | 1849ab0b94a |
13 | 9c08758324 |
14 | 5149050d06 |
15 | 2b11ceeeba |
hex | 18829e738a |
105270637450 has 24 divisors (see below), whose sum is σ = 213603694560. Its totient is φ = 38280231600.
The previous prime is 105270637447. The next prime is 105270637481. The reversal of 105270637450 is 54736072501.
It is a super-2 number, since 2×1052706374502 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
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 11 ways as a sum of consecutive naturals, for example, 95700030 + ... + 95701129.
It is an arithmetic number, because the mean of its divisors is an integer number (8900153940).
Almost surely, 2105270637450 is an apocalyptic number.
105270637450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105270637450 is an abundant number, since it is smaller than the sum of its proper divisors (108333057110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105270637450 is a wasteful number, since it uses less digits than its factorization.
105270637450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191401182 (or 191401177 counting only the distinct ones).
The product of its (nonzero) digits is 176400, while the sum is 40.
The spelling of 105270637450 in words is "one hundred five billion, two hundred seventy million, six hundred thirty-seven thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •