Base | Representation |
---|---|
bin | 10000001010100100010… |
… | …001100111000001000010 |
3 | 10221012022120122010120111 |
4 | 100022210101213001002 |
5 | 121200014024021200 |
6 | 2210153154301534 |
7 | 143154042106432 |
oct | 20124421470102 |
9 | 3835276563514 |
10 | 1110857642050 |
11 | 3991261a7192 |
12 | 15b35bb878aa |
13 | 809a437b240 |
14 | 3baa14bc2c2 |
15 | 1dd68cc00ba |
hex | 102a4467042 |
1110857642050 has 48 divisors (see below), whose sum is σ = 2321878265280. Its totient is φ = 392329650240.
The previous prime is 1110857642047. The next prime is 1110857642087. The reversal of 1110857642050 is 502467580111.
It is a junction number, because it is equal to n+sod(n) for n = 1110857641994 and 1110857642012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37137480 + ... + 37167379.
It is an arithmetic number, because the mean of its divisors is an integer number (48372463860).
Almost surely, 21110857642050 is an apocalyptic number.
1110857642050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110857642050 is an abundant number, since it is smaller than the sum of its proper divisors (1211020623230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110857642050 is a wasteful number, since it uses less digits than its factorization.
1110857642050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74304907 (or 74304902 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 40.
The spelling of 1110857642050 in words is "one trillion, one hundred ten billion, eight hundred fifty-seven million, six hundred forty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •