Base | Representation |
---|---|
bin | 10000010111010000111… |
… | …001001010011001111100 |
3 | 10222111111201102001201100 |
4 | 100113100321022121330 |
5 | 121410424211010022 |
6 | 2220330055013100 |
7 | 144145636504434 |
oct | 20272071123174 |
9 | 3874451361640 |
10 | 1124491110012 |
11 | 3a3991a09486 |
12 | 161b2596a190 |
13 | 82067a6614a |
14 | 3c5d60232c4 |
15 | 1e3b5b511ac |
hex | 105d0e4a67c |
1124491110012 has 36 divisors (see below), whose sum is σ = 2889061409416. Its totient is φ = 368685609120.
The previous prime is 1124491109941. The next prime is 1124491110019. The reversal of 1124491110012 is 2100111944211.
1124491110012 is a `hidden beast` number, since 112 + 449 + 1 + 1 + 100 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124491110019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 256029478 + ... + 256033869.
Almost surely, 21124491110012 is an apocalyptic number.
1124491110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1124491110012 is an abundant number, since it is smaller than the sum of its proper divisors (1764570299404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1124491110012 is a wasteful number, since it uses less digits than its factorization.
1124491110012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512063418 (or 512063413 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 27.
The spelling of 1124491110012 in words is "one trillion, one hundred twenty-four billion, four hundred ninety-one million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •