Base | Representation |
---|---|
bin | 111010110100100001… |
… | …0000101000111111000 |
3 | 110002001012020001020210 |
4 | 1311221002011013320 |
5 | 4032143422021121 |
6 | 134010122351120 |
7 | 12061143010614 |
oct | 1655102050770 |
9 | 402035201223 |
10 | 126316204536 |
11 | 49630228075 |
12 | 2059305b4a0 |
13 | bbb09358c2 |
14 | 6184146344 |
15 | 344474d876 |
hex | 1d690851f8 |
126316204536 has 64 divisors (see below), whose sum is σ = 323556710400. Its totient is φ = 41072467968.
The previous prime is 126316204499. The next prime is 126316204549. The reversal of 126316204536 is 635402613621.
It is a junction number, because it is equal to n+sod(n) for n = 126316204494 and 126316204503.
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 714025 + ... + 873191.
It is an arithmetic number, because the mean of its divisors is an integer number (5055573600).
Almost surely, 2126316204536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126316204536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161778355200).
126316204536 is an abundant number, since it is smaller than the sum of its proper divisors (197240505864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126316204536 is a wasteful number, since it uses less digits than its factorization.
126316204536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159988 (or 159984 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 126316204536 in words is "one hundred twenty-six billion, three hundred sixteen million, two hundred four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •