Base | Representation |
---|---|
bin | 10101101001111100… |
… | …11011001111000010 |
3 | 1010000020202001100020 |
4 | 22310332123033002 |
5 | 142302301313304 |
6 | 5201353434310 |
7 | 561052023600 |
oct | 126476331702 |
9 | 33006661306 |
10 | 11626197954 |
11 | 4a2675a668 |
12 | 230570b996 |
13 | 1133896797 |
14 | 7c4116870 |
15 | 480a345d9 |
hex | 2b4f9b3c2 |
11626197954 has 24 divisors (see below), whose sum is σ = 27048706128. Its totient is φ = 3321770760.
The previous prime is 11626197953. The next prime is 11626197959. The reversal of 11626197954 is 45979162611.
It is a happy number.
It is a super-2 number, since 2×116261979542 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11626197897 and 11626197906.
It is not an unprimeable number, because it can be changed into a prime (11626197953) 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 11 ways as a sum of consecutive naturals, for example, 19772152 + ... + 19772739.
It is an arithmetic number, because the mean of its divisors is an integer number (1127029422).
Almost surely, 211626197954 is an apocalyptic number.
11626197954 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
11626197954 is an abundant number, since it is smaller than the sum of its proper divisors (15422508174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11626197954 is a wasteful number, since it uses less digits than its factorization.
11626197954 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39544910 (or 39544903 counting only the distinct ones).
The product of its digits is 816480, while the sum is 51.
The spelling of 11626197954 in words is "eleven billion, six hundred twenty-six million, one hundred ninety-seven thousand, nine hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •