Base | Representation |
---|---|
bin | 1001111011000111110001… |
… | …0001111011100100100100 |
3 | 1102122002222101201210010101 |
4 | 2132301330101323210210 |
5 | 2412232321303211301 |
6 | 35112325525433444 |
7 | 2204213143526632 |
oct | 236617421734444 |
9 | 42562871653111 |
10 | 10911302007076 |
11 | 3527503587029 |
12 | 1282824b6b884 |
13 | 611c15290483 |
14 | 29a17755c352 |
15 | 13dc647b7701 |
hex | 9ec7c47b924 |
10911302007076 has 27 divisors (see below), whose sum is σ = 20152892815419. Its totient is φ = 5168452018968.
The previous prime is 10911302007071. The next prime is 10911302007097. The reversal of 10911302007076 is 67070020311901.
The square root of 10911302007076 is 3303226.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×109113020070762 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10911302007071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 125479125 + ... + 125566051.
Almost surely, 210911302007076 is an apocalyptic number.
10911302007076 is the 3303226-th square number.
It is an amenable number.
10911302007076 is a deficient number, since it is larger than the sum of its proper divisors (9241590808343).
10911302007076 is an frugal number, since it uses more digits than its factorization.
10911302007076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173896 (or 86948 counting only the distinct ones).
The product of its (nonzero) digits is 15876, while the sum is 37.
Adding to 10911302007076 its reverse (67070020311901), we get a palindrome (77981322318977).
The spelling of 10911302007076 in words is "ten trillion, nine hundred eleven billion, three hundred two million, seven thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •