Base | Representation |
---|---|
bin | 100000101100100… |
… | …0000000111110010 |
3 | 2211110100002102110 |
4 | 1001121000013302 |
5 | 4221322320023 |
6 | 300510030150 |
7 | 36120652650 |
oct | 10131000762 |
9 | 2743302373 |
10 | 1097073138 |
11 | 5132a6317 |
12 | 2674a8356 |
13 | 146397705 |
14 | a59b9dd0 |
15 | 664a8a93 |
hex | 416401f2 |
1097073138 has 64 divisors (see below), whose sum is σ = 2664126720. Its totient is φ = 294008832.
The previous prime is 1097073137. The next prime is 1097073151. The reversal of 1097073138 is 8313707901.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1097073096 and 1097073105.
It is not an unprimeable number, because it can be changed into a prime (1097073137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 221028 + ... + 225936.
It is an arithmetic number, because the mean of its divisors is an integer number (41626980).
Almost surely, 21097073138 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1097073138, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1332063360).
1097073138 is an abundant number, since it is smaller than the sum of its proper divisors (1567053582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1097073138 is a wasteful number, since it uses less digits than its factorization.
1097073138 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5251.
The product of its (nonzero) digits is 31752, while the sum is 39.
The square root of 1097073138 is about 33122.0944084157. The cubic root of 1097073138 is about 1031.3637442068.
The spelling of 1097073138 in words is "one billion, ninety-seven million, seventy-three thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •