Base | Representation |
---|---|
bin | 1010100100011100… |
… | …00001000011101000 |
3 | 112122110100000220000 |
4 | 11102032001003220 |
5 | 43110114421402 |
6 | 2335021303000 |
7 | 260421243354 |
oct | 52216010350 |
9 | 15573300800 |
10 | 5674373352 |
11 | 245204375a |
12 | 1124404a60 |
13 | 6c579778b |
14 | 3bb888464 |
15 | 233265c1c |
hex | 1523810e8 |
5674373352 has 80 divisors (see below), whose sum is σ = 16085139840. Its totient is φ = 1868651424.
The previous prime is 5674373347. The next prime is 5674373371. The reversal of 5674373352 is 2533734765.
5674373352 is a `hidden beast` number, since 567 + 4 + 3 + 7 + 33 + 52 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 5674373298 and 5674373307.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1033 + ... + 106535.
It is an arithmetic number, because the mean of its divisors is an integer number (201064248).
Almost surely, 25674373352 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 5674373352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8042569920).
5674373352 is an abundant number, since it is smaller than the sum of its proper divisors (10410766488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5674373352 is a wasteful number, since it uses less digits than its factorization.
5674373352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105604 (or 105591 counting only the distinct ones).
The product of its digits is 1587600, while the sum is 45.
The square root of 5674373352 is about 75328.4365429152. The cubic root of 5674373352 is about 1783.6349311979.
The spelling of 5674373352 in words is "five billion, six hundred seventy-four million, three hundred seventy-three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •