Base | Representation |
---|---|
bin | 11111111111110010010… |
… | …11001101011000000000 |
3 | 10220002201212122120120110 |
4 | 33333321023031120000 |
5 | 121003031131010012 |
6 | 2201020035511320 |
7 | 142300041244221 |
oct | 17777113153000 |
9 | 3802655576513 |
10 | 1099397125632 |
11 | 39428501a613 |
12 | 1590a1a58540 |
13 | 7c898c14290 |
14 | 3b2d53b3248 |
15 | 1d8e7ab673c |
hex | fff92cd600 |
1099397125632 has 160 divisors (see below), whose sum is σ = 3155065562880. Its totient is φ = 338178908160.
The previous prime is 1099397125553. The next prime is 1099397125643. The reversal of 1099397125632 is 2365217939901.
It is a congruent number.
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, 103408957 + ... + 103419587.
It is an arithmetic number, because the mean of its divisors is an integer number (19719159768).
Almost surely, 21099397125632 is an apocalyptic number.
1099397125632 is a gapful number since it is divisible by the number (12) 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 1099397125632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1577532781440).
1099397125632 is an abundant number, since it is smaller than the sum of its proper divisors (2055668437248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1099397125632 is a wasteful number, since it uses less digits than its factorization.
1099397125632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15844 (or 15828 counting only the distinct ones).
The product of its (nonzero) digits is 5511240, while the sum is 57.
The spelling of 1099397125632 in words is "one trillion, ninety-nine billion, three hundred ninety-seven million, one hundred twenty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •