Base | Representation |
---|---|
bin | 100000101011100… |
… | …1110001011100010 |
3 | 2211102110101020010 |
4 | 1001113032023202 |
5 | 4221212401214 |
6 | 300452025350 |
7 | 36114000210 |
oct | 10127161342 |
9 | 2742411203 |
10 | 1096606434 |
11 | 513007710 |
12 | 267302256 |
13 | 146263161 |
14 | a58d7cb0 |
15 | 66415659 |
hex | 415ce2e2 |
1096606434 has 64 divisors (see below), whose sum is σ = 2744451072. Its totient is φ = 283785600.
The previous prime is 1096606421. The next prime is 1096606439. The reversal of 1096606434 is 4346066901.
It is a junction number, because it is equal to n+sod(n) for n = 1096606392 and 1096606401.
It is not an unprimeable number, because it can be changed into a prime (1096606439) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 125599 + ... + 134045.
It is an arithmetic number, because the mean of its divisors is an integer number (42882048).
Almost surely, 21096606434 is an apocalyptic number.
1096606434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1096606434, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1372225536).
1096606434 is an abundant number, since it is smaller than the sum of its proper divisors (1647844638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1096606434 is a wasteful number, since it uses less digits than its factorization.
1096606434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8751.
The product of its (nonzero) digits is 93312, while the sum is 39.
The square root of 1096606434 is about 33115.0484523275. The cubic root of 1096606434 is about 1031.2174732367.
The spelling of 1096606434 in words is "one billion, ninety-six million, six hundred six thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •