Base | Representation |
---|---|
bin | 111001001101100011… |
… | …1010011001010010000 |
3 | 102202010102112011021011 |
4 | 1302123013103022100 |
5 | 4003110013410011 |
6 | 132235231340304 |
7 | 11606423142424 |
oct | 1623307231220 |
9 | 382112464234 |
10 | 122861466256 |
11 | 48118105071 |
12 | 1b98a081694 |
13 | b77cc85a79 |
14 | 5d373aab84 |
15 | 32e12d2621 |
hex | 1c9b1d3290 |
122861466256 has 15 divisors (see below), whose sum is σ = 238046807401. Its totient is φ = 61430032096.
The previous prime is 122861466239. The next prime is 122861466307. The reversal of 122861466256 is 652664168221.
It is a happy number.
The square root of 122861466256 is 350516.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3808864656 + 119052601600 = 61716^2 + 345040^2 .
It is a Duffinian number.
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 2 ways as a sum of consecutive naturals, for example, 1358250 + ... + 1445878.
Almost surely, 2122861466256 is an apocalyptic number.
122861466256 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
122861466256 is the 350516-th square number.
It is an amenable number.
122861466256 is a deficient number, since it is larger than the sum of its proper divisors (115185341145).
122861466256 is an frugal number, since it uses more digits than its factorization.
122861466256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175266 (or 87631 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 49.
Multiplying 122861466256 by its sum of digits (49), we get a square (6020211846544 = 24536122).
The spelling of 122861466256 in words is "one hundred twenty-two billion, eight hundred sixty-one million, four hundred sixty-six thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •