Base | Representation |
---|---|
bin | 1010011001111011011011… |
… | …0010100111000111110100 |
3 | 1111111201002121201202120002 |
4 | 2212132312302213013310 |
5 | 2444420234021130004 |
6 | 40155420044330432 |
7 | 2260360566561626 |
oct | 246366662470764 |
9 | 44451077652502 |
10 | 11440564630004 |
11 | 3710a0952a214 |
12 | 1349311b43a18 |
13 | 64cac0aa8233 |
14 | 2b7a24cc2c16 |
15 | 14c8de41c61e |
hex | a67b6ca71f4 |
11440564630004 has 12 divisors (see below), whose sum is σ = 20122617485124. Its totient is φ = 5691245348544.
The previous prime is 11440564629943. The next prime is 11440564630007. The reversal of 11440564630004 is 40003646504411.
It can be written as a sum of positive squares in 2 ways, for example, as 8260726725904 + 3179837904100 = 2874148^2 + 1783210^2 .
It is a super-2 number, since 2×114405646300042 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11440564630004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11440564630007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7259240729 + ... + 7259242304.
It is an arithmetic number, because the mean of its divisors is an integer number (1676884790427).
Almost surely, 211440564630004 is an apocalyptic number.
It is an amenable number.
11440564630004 is a deficient number, since it is larger than the sum of its proper divisors (8682052855120).
11440564630004 is a wasteful number, since it uses less digits than its factorization.
11440564630004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14518483234 (or 14518483232 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 11440564630004 in words is "eleven trillion, four hundred forty billion, five hundred sixty-four million, six hundred thirty thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.207 sec. • engine limits •