Base | Representation |
---|---|
bin | 111010111010001010… |
… | …0010011111011001101 |
3 | 110002112101110221021001 |
4 | 1311310110103323031 |
5 | 4033040404030013 |
6 | 134041004340301 |
7 | 12065632201210 |
oct | 1656424237315 |
9 | 402471427231 |
10 | 126505533133 |
11 | 49718091491 |
12 | 20626544691 |
13 | bc10c24865 |
14 | 61a134b777 |
15 | 345619addd |
hex | 1d74513ecd |
126505533133 has 64 divisors (see below), whose sum is σ = 161093836800. Its totient is φ = 96793804800.
The previous prime is 126505533113. The next prime is 126505533151. The reversal of 126505533133 is 331335505621.
It is not a de Polignac number, because 126505533133 - 25 = 126505533101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126505533092 and 126505533101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126505533113) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 281749293 + ... + 281749741.
It is an arithmetic number, because the mean of its divisors is an integer number (2517091200).
Almost surely, 2126505533133 is an apocalyptic number.
It is an amenable number.
126505533133 is a deficient number, since it is larger than the sum of its proper divisors (34588303667).
126505533133 is a wasteful number, since it uses less digits than its factorization.
126505533133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138.
The product of its (nonzero) digits is 121500, while the sum is 37.
The spelling of 126505533133 in words is "one hundred twenty-six billion, five hundred five million, five hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •