Base | Representation |
---|---|
bin | 100100100011001… |
… | …110011101101000 |
3 | 1120201212111112201 |
4 | 210203032131220 |
5 | 2223440322211 |
6 | 140503145544 |
7 | 21124143040 |
oct | 4443163550 |
9 | 1521774481 |
10 | 613214056 |
11 | 295163884 |
12 | 1514452b4 |
13 | 9a074370 |
14 | 5b626720 |
15 | 38c7d0c1 |
hex | 248ce768 |
613214056 has 128 divisors (see below), whose sum is σ = 1525708800. Its totient is φ = 224259840.
The previous prime is 613214051. The next prime is 613214087. The reversal of 613214056 is 650412316.
It is a super-2 number, since 2×6132140562 = 752062956951942272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (613214051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 594261 + ... + 595291.
It is an arithmetic number, because the mean of its divisors is an integer number (11919600).
Almost surely, 2613214056 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 613214056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (762854400).
613214056 is an abundant number, since it is smaller than the sum of its proper divisors (912494744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
613214056 is a wasteful number, since it uses less digits than its factorization.
613214056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1119 (or 1115 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 613214056 is about 24763.1592491750. The cubic root of 613214056 is about 849.5795179798.
The spelling of 613214056 in words is "six hundred thirteen million, two hundred fourteen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •