Base | Representation |
---|---|
bin | 10000010100000011100… |
… | …100011100110011001011 |
3 | 10222011121122111011210010 |
4 | 100110003210130303023 |
5 | 121331400331213201 |
6 | 2215000201523003 |
7 | 143664400521414 |
oct | 20240344346313 |
9 | 3864548434703 |
10 | 1121046351051 |
11 | 3a2484492050 |
12 | 1613241a3463 |
13 | 8193919b633 |
14 | 3c38a72480b |
15 | 1e263506bd6 |
hex | 1050391cccb |
1121046351051 has 64 divisors (see below), whose sum is σ = 1826537472000. Its totient is φ = 602755084800.
The previous prime is 1121046351011. The next prime is 1121046351059. The reversal of 1121046351051 is 1501536401211.
It is not a de Polignac number, because 1121046351051 - 27 = 1121046350923 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1121046351059) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1856886 + ... + 2385396.
It is an arithmetic number, because the mean of its divisors is an integer number (28539648000).
Almost surely, 21121046351051 is an apocalyptic number.
1121046351051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1121046351051 is a deficient number, since it is larger than the sum of its proper divisors (705491120949).
1121046351051 is a wasteful number, since it uses less digits than its factorization.
1121046351051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528760.
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 1121046351051 in words is "one trillion, one hundred twenty-one billion, forty-six million, three hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •