Base | Representation |
---|---|
bin | 101000111110011… |
… | …1111000110000000 |
3 | 10112211012021020210 |
4 | 1101330333012000 |
5 | 10303441112233 |
6 | 344233434120 |
7 | 46033545000 |
oct | 12174770600 |
9 | 3484167223 |
10 | 1374941568 |
11 | 646133a50 |
12 | 32456b940 |
13 | 18bb16ac0 |
14 | d086c000 |
15 | 80a95163 |
hex | 51f3f180 |
1374941568 has 512 divisors, whose sum is σ = 5072256000. Its totient is φ = 325140480.
The previous prime is 1374941551. The next prime is 1374941597. The reversal of 1374941568 is 8651494731.
It is a Harshad number since it is a multiple of its sum of digits (48).
Its product of digits (725760) is a multiple of the sum of its prime factors (135).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 18834780 + ... + 18834852.
It is an arithmetic number, because the mean of its divisors is an integer number (9906750).
Almost surely, 21374941568 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 1374941568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2536128000).
1374941568 is an abundant number, since it is smaller than the sum of its proper divisors (3697314432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1374941568 is a wasteful number, since it uses less digits than its factorization.
1374941568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135 (or 109 counting only the distinct ones).
The product of its digits is 725760, while the sum is 48.
The square root of 1374941568 is about 37080.2045301803. The cubic root of 1374941568 is about 1111.9742933519.
The spelling of 1374941568 in words is "one billion, three hundred seventy-four million, nine hundred forty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •