Base | Representation |
---|---|
bin | 1010101001001000101001… |
… | …1111100011011110110100 |
3 | 1112102200102120100021102111 |
4 | 2222102022133203132310 |
5 | 3013210303444120113 |
6 | 40515423410420404 |
7 | 2315266604414053 |
oct | 252221237433664 |
9 | 45380376307374 |
10 | 11701814441908 |
11 | 3801791206678 |
12 | 138ba81b91704 |
13 | 66b626769656 |
14 | 2c652983239a |
15 | 1545cebbe13d |
hex | aa48a7e37b4 |
11701814441908 has 12 divisors (see below), whose sum is σ = 20478305669220. Its totient is φ = 5850869964992.
The previous prime is 11701814441893. The next prime is 11701814441909. The reversal of 11701814441908 is 80914441810711.
It can be written as a sum of positive squares in 2 ways, for example, as 9877267267344 + 1824547174564 = 3142812^2 + 1350758^2 .
It is a super-2 number, since 2×117018144419082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11701814441909) 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 3 ways as a sum of consecutive naturals, for example, 8601223 + ... + 9868366.
It is an arithmetic number, because the mean of its divisors is an integer number (1706525472435).
Almost surely, 211701814441908 is an apocalyptic number.
It is an amenable number.
11701814441908 is a deficient number, since it is larger than the sum of its proper divisors (8776491227312).
11701814441908 is a wasteful number, since it uses less digits than its factorization.
11701814441908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18627986 (or 18627984 counting only the distinct ones).
The product of its (nonzero) digits is 258048, while the sum is 49.
The spelling of 11701814441908 in words is "eleven trillion, seven hundred one billion, eight hundred fourteen million, four hundred forty-one thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •