Base | Representation |
---|---|
bin | 10111111001000000101000… |
… | …001100101000101111110000 |
3 | 111210000212010220112120212020 |
4 | 113321000220030220233300 |
5 | 102233003000102034413 |
6 | 1011245431301031440 |
7 | 31063153542412431 |
oct | 2771005014505760 |
9 | 453025126476766 |
10 | 105072754330608 |
11 | 30530117640099 |
12 | b94b9789b5580 |
13 | 468241a18187c |
14 | 1bd3796d07488 |
15 | c232b4319c23 |
hex | 5f9028328bf0 |
105072754330608 has 20 divisors (see below), whose sum is σ = 271437948687528. Its totient is φ = 35024251443520.
The previous prime is 105072754330601. The next prime is 105072754330619. The reversal of 105072754330608 is 806033457270501.
105072754330608 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1050727543306082 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105072754330601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1094507857563 + ... + 1094507857658.
Almost surely, 2105072754330608 is an apocalyptic number.
It is an amenable number.
105072754330608 is an abundant number, since it is smaller than the sum of its proper divisors (166365194356920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105072754330608 is a wasteful number, since it uses less digits than its factorization.
105072754330608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2189015715232 (or 2189015715226 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 51.
The spelling of 105072754330608 in words is "one hundred five trillion, seventy-two billion, seven hundred fifty-four million, three hundred thirty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •