Base | Representation |
---|---|
bin | 100000010101010… |
… | …1101111100000000 |
3 | 2210121111122221011 |
4 | 1000222231330000 |
5 | 4210221040112 |
6 | 255354010304 |
7 | 35612560321 |
oct | 10052557400 |
9 | 2717448834 |
10 | 1084940032 |
11 | 507469560 |
12 | 263416994 |
13 | 143a09c67 |
14 | a413c448 |
15 | 653adaa7 |
hex | 40aadf00 |
1084940032 has 72 divisors (see below), whose sum is σ = 2420398512. Its totient is φ = 481075200.
The previous prime is 1084940023. The next prime is 1084940069. The reversal of 1084940032 is 2300494801.
It is a super-2 number, since 2×10849400322 = 2354189746072322048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1084939976 and 1084940003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110758 + ... + 120154.
It is an arithmetic number, because the mean of its divisors is an integer number (33616646).
Almost surely, 21084940032 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 1084940032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1210199256).
1084940032 is an abundant number, since it is smaller than the sum of its proper divisors (1335458480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1084940032 is an equidigital number, since it uses as much as digits as its factorization.
1084940032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9465 (or 9451 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 1084940032 is about 32938.4278920534. The cubic root of 1084940032 is about 1027.5475103879.
The spelling of 1084940032 in words is "one billion, eighty-four million, nine hundred forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •