Base | Representation |
---|---|
bin | 10100111110011000… |
… | …01000001000000000 |
3 | 1002001202222100222120 |
4 | 22133030020020000 |
5 | 141030214102234 |
6 | 5101215404240 |
7 | 546023202516 |
oct | 123714101000 |
9 | 32052870876 |
10 | 11260690944 |
11 | 4859403858 |
12 | 2223223680 |
13 | 10a5c41249 |
14 | 78b7704b6 |
15 | 45d8d6049 |
hex | 29f308200 |
11260690944 has 40 divisors (see below), whose sum is σ = 29999188560. Its totient is φ = 3753563136.
The previous prime is 11260690939. The next prime is 11260690949. The reversal of 11260690944 is 44909606211.
It is an interprime number because it is at equal distance from previous prime (11260690939) and next prime (11260690949).
It is a super-2 number, since 2×112606909442 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11260690896 and 11260690905.
It is not an unprimeable number, because it can be changed into a prime (11260690949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3664054 + ... + 3667125.
It is an arithmetic number, because the mean of its divisors is an integer number (749979714).
Almost surely, 211260690944 is an apocalyptic number.
It is an amenable number.
11260690944 is an abundant number, since it is smaller than the sum of its proper divisors (18738497616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11260690944 is an frugal number, since it uses more digits than its factorization.
11260690944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7331200 (or 7331184 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 42.
The spelling of 11260690944 in words is "eleven billion, two hundred sixty million, six hundred ninety thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •