Base | Representation |
---|---|
bin | 111000100111000110… |
… | …0101010010110100100 |
3 | 102121210111100000111012 |
4 | 1301032030222112210 |
5 | 3442434140320330 |
6 | 131503213001352 |
7 | 11532433450061 |
oct | 1611614522644 |
9 | 377714300435 |
10 | 121571026340 |
11 | 476157474a5 |
12 | 1b689a83258 |
13 | b60581735a |
14 | 5c53c57c68 |
15 | 3267d7ec95 |
hex | 1c4e32a5a4 |
121571026340 has 12 divisors (see below), whose sum is σ = 255299155356. Its totient is φ = 48628410528.
The previous prime is 121571026333. The next prime is 121571026361. The reversal of 121571026340 is 43620175121.
It can be written as a sum of positive squares in 2 ways, for example, as 33363214336 + 88207812004 = 182656^2 + 296998^2 .
It is a junction number, because it is equal to n+sod(n) for n = 121571026297 and 121571026306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3039275639 + ... + 3039275678.
It is an arithmetic number, because the mean of its divisors is an integer number (21274929613).
Almost surely, 2121571026340 is an apocalyptic number.
121571026340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121571026340 is an abundant number, since it is smaller than the sum of its proper divisors (133728129016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121571026340 is a wasteful number, since it uses less digits than its factorization.
121571026340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6078551326 (or 6078551324 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 32.
The spelling of 121571026340 in words is "one hundred twenty-one billion, five hundred seventy-one million, twenty-six thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •