Base | Representation |
---|---|
bin | 10101010011001010… |
… | …11010100000001000 |
3 | 1002111221010212020001 |
4 | 22221211122200020 |
5 | 141404340420401 |
6 | 5130405412344 |
7 | 553241451400 |
oct | 125145324010 |
9 | 32457125201 |
10 | 11435091976 |
11 | 49388a1940 |
12 | 227170a0b4 |
13 | 1103104819 |
14 | 7a69ab800 |
15 | 46dd85601 |
hex | 2a995a808 |
11435091976 has 96 divisors (see below), whose sum is σ = 28391964480. Its totient is φ = 4261488000.
The previous prime is 11435091949. The next prime is 11435091989. The reversal of 11435091976 is 67919053411.
It is a super-2 number, since 2×114350919762 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (46).
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, 41526 + ... + 156826.
It is an arithmetic number, because the mean of its divisors is an integer number (295749630).
Almost surely, 211435091976 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11435091976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14195982240).
11435091976 is an abundant number, since it is smaller than the sum of its proper divisors (16956872504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11435091976 is a wasteful number, since it uses less digits than its factorization.
11435091976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115355 (or 115344 counting only the distinct ones).
The product of its (nonzero) digits is 204120, while the sum is 46.
The spelling of 11435091976 in words is "eleven billion, four hundred thirty-five million, ninety-one thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •