Base | Representation |
---|---|
bin | 111010110010111100… |
… | …1001001111100100110 |
3 | 110001220112010001222010 |
4 | 1311211321021330212 |
5 | 4032041431031400 |
6 | 134001001415050 |
7 | 12056633216403 |
oct | 1654571117446 |
9 | 401815101863 |
10 | 126263533350 |
11 | 49603522469 |
12 | 2057949a486 |
13 | bba2a53716 |
14 | 617b1552aa |
15 | 343ece7450 |
hex | 1d65e49f26 |
126263533350 has 48 divisors (see below), whose sum is σ = 315599228928. Its totient is φ = 33405150240.
The previous prime is 126263533327. The next prime is 126263533351. The reversal of 126263533350 is 53335362621.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 126263533299 and 126263533308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126263533351) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3294954 + ... + 3333053.
It is an arithmetic number, because the mean of its divisors is an integer number (6574983936).
Almost surely, 2126263533350 is an apocalyptic number.
126263533350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
126263533350 is an abundant number, since it is smaller than the sum of its proper divisors (189335695578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126263533350 is a wasteful number, since it uses less digits than its factorization.
126263533350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6628149 (or 6628144 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 39.
Adding to 126263533350 its reverse (53335362621), we get a palindrome (179598895971).
The spelling of 126263533350 in words is "one hundred twenty-six billion, two hundred sixty-three million, five hundred thirty-three thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •