Base | Representation |
---|---|
bin | 111010110111000101… |
… | …0011110100011111001 |
3 | 110002021012012201222221 |
4 | 1311232022132203321 |
5 | 4032332441320321 |
6 | 134022435444041 |
7 | 12063236516431 |
oct | 1655612364371 |
9 | 402235181887 |
10 | 126402291961 |
11 | 49674886900 |
12 | 205b7a56621 |
13 | bbc57179ca |
14 | 61917552c1 |
15 | 344c0a5e41 |
hex | 1d6e29e8f9 |
126402291961 has 9 divisors (see below), whose sum is σ = 138942355279. Its totient is φ = 114907619200.
The previous prime is 126402291947. The next prime is 126402291989. The reversal of 126402291961 is 169192204621.
The square root of 126402291961 is 355531.
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., 46109402361 + 80292889600 = 214731^2 + 283360^2 .
It is a de Polignac number, because none of the positive numbers 2k-126402291961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126402291901) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3894681 + ... + 3927001.
Almost surely, 2126402291961 is an apocalyptic number.
126402291961 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
126402291961 is the 355531-st square number.
126402291961 is the 177766-th centered octagonal number.
It is an amenable number.
126402291961 is a deficient number, since it is larger than the sum of its proper divisors (12540063318).
126402291961 is an frugal number, since it uses more digits than its factorization.
126402291961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64664 (or 32332 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 43.
The spelling of 126402291961 in words is "one hundred twenty-six billion, four hundred two million, two hundred ninety-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •