Base | Representation |
---|---|
bin | 101001000110111… |
… | …0010100011110000 |
3 | 10120010111001220210 |
4 | 1102031302203300 |
5 | 10311103043142 |
6 | 344512104120 |
7 | 46116152604 |
oct | 12215624360 |
9 | 3503431823 |
10 | 1379346672 |
11 | 648672630 |
12 | 325b35040 |
13 | 18c9c9b82 |
14 | d1297504 |
15 | 8116549c |
hex | 523728f0 |
1379346672 has 40 divisors (see below), whose sum is σ = 3887251200. Its totient is φ = 417983680.
The previous prime is 1379346671. The next prime is 1379346673. The reversal of 1379346672 is 2766439731.
It is an interprime number because it is at equal distance from previous prime (1379346671) and next prime (1379346673).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1379346671) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1305672 + ... + 1306727.
It is an arithmetic number, because the mean of its divisors is an integer number (97181280).
Almost surely, 21379346672 is an apocalyptic number.
1379346672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1379346672 is an abundant number, since it is smaller than the sum of its proper divisors (2507904528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1379346672 is a wasteful number, since it uses less digits than its factorization.
1379346672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2612421 (or 2612415 counting only the distinct ones).
The product of its digits is 1143072, while the sum is 48.
The square root of 1379346672 is about 37139.5567017163. The cubic root of 1379346672 is about 1113.1605596412.
The spelling of 1379346672 in words is "one billion, three hundred seventy-nine million, three hundred forty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •