Base | Representation |
---|---|
bin | 10111011011000100001000… |
… | …000001000011101100101010 |
3 | 111111202010112020202220122022 |
4 | 113123010020001003230222 |
5 | 102000244031310331303 |
6 | 1003032223034424442 |
7 | 30461403606441125 |
oct | 2733041001035452 |
9 | 444663466686568 |
10 | 103014925089578 |
11 | 2a90742568a627 |
12 | b678b95b92122 |
13 | 456335bb242a8 |
14 | 1b61d3ddcd3bc |
15 | bd99c447c438 |
hex | 5db108043b2a |
103014925089578 has 8 divisors (see below), whose sum is σ = 154522735851168. Its totient is φ = 51507346472524.
The previous prime is 103014925089577. The next prime is 103014925089619. The reversal of 103014925089578 is 875980529410301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030149250895782 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103014925089578.
It is not an unprimeable number, because it can be changed into a prime (103014925089577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56922476 + ... + 58704327.
It is an arithmetic number, because the mean of its divisors is an integer number (19315341981396).
Almost surely, 2103014925089578 is an apocalyptic number.
103014925089578 is a deficient number, since it is larger than the sum of its proper divisors (51507810761590).
103014925089578 is a wasteful number, since it uses less digits than its factorization.
103014925089578 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116072268.
The product of its (nonzero) digits is 21772800, while the sum is 62.
The spelling of 103014925089578 in words is "one hundred three trillion, fourteen billion, nine hundred twenty-five million, eighty-nine thousand, five hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •