Base | Representation |
---|---|
bin | 100000101011011… |
… | …0011000011000000 |
3 | 2211102020201202220 |
4 | 1001112303003000 |
5 | 4221200322141 |
6 | 300445411040 |
7 | 36113025201 |
oct | 10126630300 |
9 | 2742221686 |
10 | 1096495296 |
11 | 512a41166 |
12 | 267269a80 |
13 | 1462246b0 |
14 | a58a95a8 |
15 | 663e2766 |
hex | 415b30c0 |
1096495296 has 224 divisors, whose sum is σ = 3320905728. Its totient is φ = 316846080.
The previous prime is 1096495271. The next prime is 1096495303. The reversal of 1096495296 is 6925946901.
It is an unprimeable number.
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, 2862721 + ... + 2863103.
It is an arithmetic number, because the mean of its divisors is an integer number (14825472).
Almost surely, 21096495296 is an apocalyptic number.
1096495296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1096495296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1660452864).
1096495296 is an abundant number, since it is smaller than the sum of its proper divisors (2224410432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1096495296 is a wasteful number, since it uses less digits than its factorization.
1096495296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 469 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 51.
The square root of 1096495296 is about 33113.3703509625. The cubic root of 1096495296 is about 1031.1826350560.
The spelling of 1096495296 in words is "one billion, ninety-six million, four hundred ninety-five thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •