Base | Representation |
---|---|
bin | 10100100110001101… |
… | …00011111011110110 |
3 | 1001112122101210111210 |
4 | 22103012203323312 |
5 | 140121310433043 |
6 | 5025133142250 |
7 | 541011434151 |
oct | 122306437366 |
9 | 31478353453 |
10 | 11057905398 |
11 | 4764998aa1 |
12 | 218732a986 |
13 | 1072c200b7 |
14 | 76c864c98 |
15 | 44abcb633 |
hex | 2931a3ef6 |
11057905398 has 8 divisors (see below), whose sum is σ = 22115810808. Its totient is φ = 3685968464.
The previous prime is 11057905393. The next prime is 11057905403. The reversal of 11057905398 is 89350975011.
It is an interprime number because it is at equal distance from previous prime (11057905393) and next prime (11057905403).
It is a sphenic number, since it is the product of 3 distinct primes.
11057905398 is an admirable number.
It is a super-2 number, since 2×110579053982 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11057905393) 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 3 ways as a sum of consecutive naturals, for example, 921492111 + ... + 921492122.
It is an arithmetic number, because the mean of its divisors is an integer number (2764476351).
Almost surely, 211057905398 is an apocalyptic number.
11057905398 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11057905398 is a wasteful number, since it uses less digits than its factorization.
11057905398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1842984238.
The product of its (nonzero) digits is 340200, while the sum is 48.
The spelling of 11057905398 in words is "eleven billion, fifty-seven million, nine hundred five thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •