Base | Representation |
---|---|
bin | 1011000010011110001… |
… | …00001110010000000000 |
3 | 1100020222221001200112220 |
4 | 11201033010032100000 |
5 | 22203233102112211 |
6 | 450123540251040 |
7 | 36255000440043 |
oct | 5411704162000 |
9 | 1306887050486 |
10 | 379283629056 |
11 | 1369427a2282 |
12 | 616113a0a80 |
13 | 299c6711997 |
14 | 14500ac0c5a |
15 | 9cecd24806 |
hex | 584f10e400 |
379283629056 has 352 divisors, whose sum is σ = 1077577482240. Its totient is φ = 118419456000.
The previous prime is 379283629037. The next prime is 379283629139. The reversal of 379283629056 is 650926382973.
It is a super-2 number, since 2×3792836290562 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 452065885 + ... + 452066723.
Almost surely, 2379283629056 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 379283629056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (538788741120).
379283629056 is an abundant number, since it is smaller than the sum of its proper divisors (698293853184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
379283629056 is a wasteful number, since it uses less digits than its factorization.
379283629056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041 (or 1023 counting only the distinct ones).
The product of its (nonzero) digits is 29393280, while the sum is 60.
The spelling of 379283629056 in words is "three hundred seventy-nine billion, two hundred eighty-three million, six hundred twenty-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •