Base | Representation |
---|---|
bin | 10101001100000101… |
… | …00101101110010100 |
3 | 1002100210020221110000 |
4 | 22212002211232110 |
5 | 141244130200002 |
6 | 5120443131300 |
7 | 551620161456 |
oct | 124602455624 |
9 | 32323227400 |
10 | 11375631252 |
11 | 490827a147 |
12 | 2255813b30 |
13 | 10c39b616b |
14 | 79cb302d6 |
15 | 468a3c61c |
hex | 2a60a5b94 |
11375631252 has 120 divisors (see below), whose sum is σ = 30522492000. Its totient is φ = 3692412864.
The previous prime is 11375631233. The next prime is 11375631269. The reversal of 11375631252 is 25213657311.
11375631252 is a `hidden beast` number, since 1 + 1 + 37 + 563 + 12 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 5418499 + ... + 5420597.
It is an arithmetic number, because the mean of its divisors is an integer number (254354100).
Almost surely, 211375631252 is an apocalyptic number.
11375631252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11375631252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15261246000).
11375631252 is an abundant number, since it is smaller than the sum of its proper divisors (19146860748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11375631252 is a wasteful number, since it uses less digits than its factorization.
11375631252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2547 (or 2536 counting only the distinct ones).
The product of its digits is 37800, while the sum is 36.
The spelling of 11375631252 in words is "eleven billion, three hundred seventy-five million, six hundred thirty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •