Base | Representation |
---|---|
bin | 101001101000111… |
… | …1100010111110000 |
3 | 10121101002202102220 |
4 | 1103101330113300 |
5 | 10330141301111 |
6 | 350351041040 |
7 | 46424053200 |
oct | 12321742760 |
9 | 3541082386 |
10 | 1397212656 |
11 | 657765604 |
12 | 32bb10180 |
13 | 193613b68 |
14 | d37c8400 |
15 | 829e3e06 |
hex | 5347c5f0 |
1397212656 has 120 divisors (see below), whose sum is σ = 4334436864. Its totient is φ = 386305920.
The previous prime is 1397212651. The next prime is 1397212669. The reversal of 1397212656 is 6562127931.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1397212651) 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, 63331 + ... + 82493.
Almost surely, 21397212656 is an apocalyptic number.
1397212656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1397212656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2167218432).
1397212656 is an abundant number, since it is smaller than the sum of its proper divisors (2937224208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1397212656 is a wasteful number, since it uses less digits than its factorization.
1397212656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19219 (or 19206 counting only the distinct ones).
The product of its digits is 136080, while the sum is 42.
The square root of 1397212656 is about 37379.3078587606. The cubic root of 1397212656 is about 1117.9460271797.
The spelling of 1397212656 in words is "one billion, three hundred ninety-seven million, two hundred twelve thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •