Base | Representation |
---|---|
bin | 1111000010111… |
… | …01101001101000 |
3 | 22210111021021220 |
4 | 13201131221220 |
5 | 224302301322 |
6 | 20305102040 |
7 | 3061535043 |
oct | 741355150 |
9 | 283437256 |
10 | 126212712 |
11 | 6527552a |
12 | 36327920 |
13 | 201c09a2 |
14 | 12a95c5a |
15 | b13155c |
hex | 785da68 |
126212712 has 16 divisors (see below), whose sum is σ = 315531840. Its totient is φ = 42070896.
The previous prime is 126212711. The next prime is 126212717. The reversal of 126212712 is 217212621.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 5258863 = 126212712 / (1 + 2 + 6 + 2 + 1 + 2 + 7 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (126212711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2629408 + ... + 2629455.
It is an arithmetic number, because the mean of its divisors is an integer number (19720740).
Almost surely, 2126212712 is an apocalyptic number.
126212712 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
126212712 is an abundant number, since it is smaller than the sum of its proper divisors (189319128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126212712 is a wasteful number, since it uses less digits than its factorization.
126212712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5258872 (or 5258868 counting only the distinct ones).
The product of its digits is 672, while the sum is 24.
The square root of 126212712 is about 11234.4431103638. The cubic root of 126212712 is about 501.6117482857.
Subtracting 126212712 from its reverse (217212621), we obtain a palindrome (90999909).
The spelling of 126212712 in words is "one hundred twenty-six million, two hundred twelve thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •