Base | Representation |
---|---|
bin | 11111110000110100000… |
… | …10101011100110101010 |
3 | 10212022222122202100111120 |
4 | 33320122002223212222 |
5 | 120340100300304230 |
6 | 2153210242240110 |
7 | 141563612033205 |
oct | 17703202534652 |
9 | 3768878670446 |
10 | 1091358603690 |
11 | 39092a531053 |
12 | 157619956036 |
13 | 7bbb7704314 |
14 | 3ab7195c93c |
15 | 1d5c700c310 |
hex | fe1a0ab9aa |
1091358603690 has 32 divisors (see below), whose sum is σ = 2757116473920. Its totient is φ = 275711647104.
The previous prime is 1091358603641. The next prime is 1091358603703. The reversal of 1091358603690 is 963068531901.
It is a super-2 number, since 2×10913586036902 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 957331539 + ... + 957332678.
It is an arithmetic number, because the mean of its divisors is an integer number (86159889810).
Almost surely, 21091358603690 is an apocalyptic number.
1091358603690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1091358603690 is an abundant number, since it is smaller than the sum of its proper divisors (1665757870230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1091358603690 is a wasteful number, since it uses less digits than its factorization.
1091358603690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1914664246.
The product of its (nonzero) digits is 1049760, while the sum is 51.
The spelling of 1091358603690 in words is "one trillion, ninety-one billion, three hundred fifty-eight million, six hundred three thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •