Base | Representation |
---|---|
bin | 100000101010001… |
… | …1111101000001100 |
3 | 2211101010001110220 |
4 | 1001110133220030 |
5 | 4221022011333 |
6 | 300424431340 |
7 | 36104631600 |
oct | 10124375014 |
9 | 2741101426 |
10 | 1095891468 |
11 | 512669531 |
12 | 267018550 |
13 | 1460728b9 |
14 | a578d500 |
15 | 663238b3 |
hex | 4151fa0c |
1095891468 has 108 divisors (see below), whose sum is σ = 3160319400. Its totient is φ = 294647808.
The previous prime is 1095891457. The next prime is 1095891487. The reversal of 1095891468 is 8641985901.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 1095891468.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 166708 + ... + 173156.
Almost surely, 21095891468 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 1095891468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1580159700).
1095891468 is an abundant number, since it is smaller than the sum of its proper divisors (2064427932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1095891468 is a wasteful number, since it uses less digits than its factorization.
1095891468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6504 (or 6478 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 51.
The square root of 1095891468 is about 33104.2515094361. The cubic root of 1095891468 is about 1030.9933132892.
The spelling of 1095891468 in words is "one billion, ninety-five million, eight hundred ninety-one thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •