Base | Representation |
---|---|
bin | 111010110101100101… |
… | …1011010011000001010 |
3 | 110002010200222002001020 |
4 | 1311223023122120022 |
5 | 4032232131032242 |
6 | 134013450133310 |
7 | 12062061011310 |
oct | 1655313323012 |
9 | 402120862036 |
10 | 126352205322 |
11 | 49649586a92 |
12 | 205a3121236 |
13 | bbb822c045 |
14 | 6188c380b0 |
15 | 34479b06ec |
hex | 1d6b2da60a |
126352205322 has 128 divisors (see below), whose sum is σ = 313668288000. Its totient is φ = 33110777856.
The previous prime is 126352205303. The next prime is 126352205351. The reversal of 126352205322 is 223502253621.
126352205322 is a modest number, since divided by 205322 gives 126352 as remainder.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5627254 + ... + 5649662.
It is an arithmetic number, because the mean of its divisors is an integer number (2450533500).
Almost surely, 2126352205322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126352205322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156834144000).
126352205322 is an abundant number, since it is smaller than the sum of its proper divisors (187316082678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126352205322 is a wasteful number, since it uses less digits than its factorization.
126352205322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22640.
The product of its (nonzero) digits is 43200, while the sum is 33.
Adding to 126352205322 its reverse (223502253621), we get a palindrome (349854458943).
The spelling of 126352205322 in words is "one hundred twenty-six billion, three hundred fifty-two million, two hundred five thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •