Base | Representation |
---|---|
bin | 110000111001101001… |
… | …0011111001010000000 |
3 | 101001001120022112121100 |
4 | 1201303102133022000 |
5 | 3210031420104102 |
6 | 120124214254400 |
7 | 10405221344004 |
oct | 1416322371200 |
9 | 331046275540 |
10 | 105013441152 |
11 | 405993936a4 |
12 | 18428957400 |
13 | 9b97396279 |
14 | 5122c20704 |
15 | 2ae9448a1c |
hex | 187349f280 |
105013441152 has 96 divisors (see below), whose sum is σ = 302252258880. Its totient is φ = 34996935168.
The previous prime is 105013441133. The next prime is 105013441177. The reversal of 105013441152 is 251144310501.
105013441152 is a `hidden beast` number, since 1 + 0 + 501 + 3 + 4 + 4 + 1 + 152 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1050134411522 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8641993 + ... + 8654135.
It is an arithmetic number, because the mean of its divisors is an integer number (3148461030).
Almost surely, 2105013441152 is an apocalyptic number.
105013441152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105013441152 is an abundant number, since it is smaller than the sum of its proper divisors (197238817728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105013441152 is a wasteful number, since it uses less digits than its factorization.
105013441152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19670 (or 19655 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 105013441152 its reverse (251144310501), we get a palindrome (356157751653).
The spelling of 105013441152 in words is "one hundred five billion, thirteen million, four hundred forty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •