Base | Representation |
---|---|
bin | 111110011001011… |
… | …010101101001100 |
3 | 2200221211111202022 |
4 | 332121122231030 |
5 | 4120443203010 |
6 | 251513345312 |
7 | 34641036632 |
oct | 7631325514 |
9 | 2627744668 |
10 | 1046850380 |
11 | 497a13204 |
12 | 252708238 |
13 | 138b61ac4 |
14 | 9d065352 |
15 | 61d87d55 |
hex | 3e65ab4c |
1046850380 has 12 divisors (see below), whose sum is σ = 2198385840. Its totient is φ = 418740144.
The previous prime is 1046850373. The next prime is 1046850401. The reversal of 1046850380 is 830586401.
It is a super-2 number, since 2×10468503802 = 2191791436212288800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1046850380.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 26171240 + ... + 26171279.
It is an arithmetic number, because the mean of its divisors is an integer number (183198820).
Almost surely, 21046850380 is an apocalyptic number.
1046850380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1046850380 is an abundant number, since it is smaller than the sum of its proper divisors (1151535460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1046850380 is a wasteful number, since it uses less digits than its factorization.
1046850380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52342528 (or 52342526 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 35.
The square root of 1046850380 is about 32355.0673001927. The cubic root of 1046850380 is about 1015.3790652230.
The spelling of 1046850380 in words is "one billion, forty-six million, eight hundred fifty thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •