Base | Representation |
---|---|
bin | 111010110010111000… |
… | …0010110101010101000 |
3 | 110001220100202212002100 |
4 | 1311211300112222220 |
5 | 4032040333214102 |
6 | 134000440133400 |
7 | 12056604500025 |
oct | 1654560265250 |
9 | 401810685070 |
10 | 126261226152 |
11 | 49602196a96 |
12 | 20578767260 |
13 | bba2426509 |
14 | 617ab1454c |
15 | 343e9dda1c |
hex | 1d65c16aa8 |
126261226152 has 48 divisors (see below), whose sum is σ = 342019398240. Its totient is φ = 42079455648.
The previous prime is 126261226109. The next prime is 126261226153. The reversal of 126261226152 is 251622162621.
126261226152 is a `hidden beast` number, since 1 + 2 + 6 + 2 + 612 + 26 + 15 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (126261226153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 248923 + ... + 560789.
It is an arithmetic number, because the mean of its divisors is an integer number (7125404130).
Almost surely, 2126261226152 is an apocalyptic number.
126261226152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
126261226152 is an abundant number, since it is smaller than the sum of its proper divisors (215758172088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126261226152 is a wasteful number, since it uses less digits than its factorization.
126261226152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317502 (or 317495 counting only the distinct ones).
The product of its digits is 34560, while the sum is 36.
Adding to 126261226152 its reverse (251622162621), we get a palindrome (377883388773).
The spelling of 126261226152 in words is "one hundred twenty-six billion, two hundred sixty-one million, two hundred twenty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •