Base | Representation |
---|---|
bin | 11000011010010010010000… |
… | …010110111001000000100000 |
3 | 112002010110102212210101210120 |
4 | 120122102100112321000200 |
5 | 103032434100124404332 |
6 | 1020200123321400240 |
7 | 31420314422630166 |
oct | 3032222026710040 |
9 | 462113385711716 |
10 | 107359424450592 |
11 | 31231970280006 |
12 | 1005ab86039080 |
13 | 47b9c47a12872 |
14 | 1c7231c41d236 |
15 | c629e95e232c |
hex | 61a4905b9020 |
107359424450592 has 48 divisors (see below), whose sum is σ = 281826986313600. Its totient is φ = 35785395816192.
The previous prime is 107359424450573. The next prime is 107359424450653. The reversal of 107359424450592 is 295054424953701.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1073594244505922 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13655683 + ... + 20029890.
It is an arithmetic number, because the mean of its divisors is an integer number (5871395548200).
Almost surely, 2107359424450592 is an apocalyptic number.
107359424450592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
107359424450592 is an abundant number, since it is smaller than the sum of its proper divisors (174467561863008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107359424450592 is a wasteful number, since it uses less digits than its factorization.
107359424450592 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33718785 (or 33718777 counting only the distinct ones).
The product of its (nonzero) digits is 54432000, while the sum is 60.
The spelling of 107359424450592 in words is "one hundred seven trillion, three hundred fifty-nine billion, four hundred twenty-four million, four hundred fifty thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •