Base | Representation |
---|---|
bin | 1000110111101011… |
… | …1100010111100000 |
3 | 20010221100022120022 |
4 | 2031322330113200 |
5 | 14334021222242 |
6 | 1032133533012 |
7 | 113001332606 |
oct | 21572742740 |
9 | 6127308508 |
10 | 2381039072 |
11 | 1012041995 |
12 | 5654a4168 |
13 | 2bc3aa479 |
14 | 188325876 |
15 | de07d0d2 |
hex | 8debc5e0 |
2381039072 has 96 divisors (see below), whose sum is σ = 4953312000. Its totient is φ = 1125273600.
The previous prime is 2381039071. The next prime is 2381039081. The reversal of 2381039072 is 2709301832.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2381039071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13154822 + ... + 13155002.
It is an arithmetic number, because the mean of its divisors is an integer number (51597000).
Almost surely, 22381039072 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 2381039072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2476656000).
2381039072 is an abundant number, since it is smaller than the sum of its proper divisors (2572272928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2381039072 is a wasteful number, since it uses less digits than its factorization.
2381039072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460 (or 452 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 35.
The square root of 2381039072 is about 48795.8919582376. The cubic root of 2381039072 is about 1335.3307212260.
The spelling of 2381039072 in words is "two billion, three hundred eighty-one million, thirty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •