Base | Representation |
---|---|
bin | 10111011011001001010000… |
… | …001000110001110010110011 |
3 | 111111202122201220022101021222 |
4 | 113123021100020301302303 |
5 | 102000341320042241433 |
6 | 1003034533204535255 |
7 | 30461660202652022 |
oct | 2733112010616263 |
9 | 444678656271258 |
10 | 103020430040243 |
11 | 2a9097a0025531 |
12 | b67a0716b152b |
13 | 4563a2847c451 |
14 | 1b623031748b9 |
15 | bd9be78c8b98 |
hex | 5db250231cb3 |
103020430040243 has 8 divisors (see below), whose sum is σ = 103676658821568. Its totient is φ = 102364496400744.
The previous prime is 103020430040197. The next prime is 103020430040251. The reversal of 103020430040243 is 342040034020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103020430040243 - 242 = 98622383529139 is a prime.
It is a super-2 number, since 2×1030204300402432 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103020430046243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73085105 + ... + 74481362.
It is an arithmetic number, because the mean of its divisors is an integer number (12959582352696).
Almost surely, 2103020430040243 is an apocalyptic number.
103020430040243 is a deficient number, since it is larger than the sum of its proper divisors (656228781325).
103020430040243 is a wasteful number, since it uses less digits than its factorization.
103020430040243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147570913.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 103020430040243 its reverse (342040034020301), we get a palindrome (445060464060544).
The spelling of 103020430040243 in words is "one hundred three trillion, twenty billion, four hundred thirty million, forty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •