Base | Representation |
---|---|
bin | 100100100011100… |
… | …000010001010100 |
3 | 1120202000012121012 |
4 | 210203200101110 |
5 | 2224000140441 |
6 | 140504511352 |
7 | 21124565510 |
oct | 4443402124 |
9 | 1522005535 |
10 | 613286996 |
11 | 295203663 |
12 | 15147b558 |
13 | 9a09b61a |
14 | 5b645140 |
15 | 38c949eb |
hex | 248e0454 |
613286996 has 48 divisors (see below), whose sum is σ = 1284837120. Its totient is φ = 250440960.
The previous prime is 613286969. The next prime is 613287001. The reversal of 613286996 is 699682316.
It is a super-2 number, since 2×6132869962 = 752241878925408032, which contains 22 as substring.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179270 + ... + 182658.
It is an arithmetic number, because the mean of its divisors is an integer number (26767440).
Almost surely, 2613286996 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 613286996, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (642418560).
613286996 is an abundant number, since it is smaller than the sum of its proper divisors (671550124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
613286996 is a wasteful number, since it uses less digits than its factorization.
613286996 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3704 (or 3702 counting only the distinct ones).
The product of its digits is 839808, while the sum is 50.
The square root of 613286996 is about 24764.6319576932. The cubic root of 613286996 is about 849.6132016354.
The spelling of 613286996 in words is "six hundred thirteen million, two hundred eighty-six thousand, nine hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •