Base | Representation |
---|---|
bin | 10110000101011110… |
… | …00100011111001010 |
3 | 1010121100010201210220 |
4 | 23002233010133022 |
5 | 143240401204032 |
6 | 5240321450510 |
7 | 566554202340 |
oct | 130257043712 |
9 | 33540121726 |
10 | 11857053642 |
11 | 5034aa7995 |
12 | 236aaa0a36 |
13 | 116c665395 |
14 | 806a4b990 |
15 | 495e3612c |
hex | 2c2bc47ca |
11857053642 has 16 divisors (see below), whose sum is σ = 27101836992. Its totient is φ = 3387729600.
The previous prime is 11857053601. The next prime is 11857053661. The reversal of 11857053642 is 24635075811.
It is a happy number.
11857053642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 282310801 = 11857053642 / (1 + 1 + 8 + 5 + 7 + 0 + 5 + 3 + 6 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 11857053594 and 11857053603.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 141155359 + ... + 141155442.
It is an arithmetic number, because the mean of its divisors is an integer number (1693864812).
Almost surely, 211857053642 is an apocalyptic number.
11857053642 is an abundant number, since it is smaller than the sum of its proper divisors (15244783350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11857053642 is a wasteful number, since it uses less digits than its factorization.
11857053642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282310813.
The product of its (nonzero) digits is 201600, while the sum is 42.
The spelling of 11857053642 in words is "eleven billion, eight hundred fifty-seven million, fifty-three thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •