Base | Representation |
---|---|
bin | 11111111000100111100011… |
… | …110110101010010000101101 |
3 | 200101111212200102222102211010 |
4 | 133320213203312222100231 |
5 | 121340012432230112023 |
6 | 1214124511422215433 |
7 | 41352204221033403 |
oct | 3770474366522055 |
9 | 611455612872733 |
10 | 140230210004013 |
11 | 40755330831608 |
12 | 13889679724579 |
13 | 603286277259c |
14 | 268b26d681473 |
15 | 1132a99c1d093 |
hex | 7f89e3daa42d |
140230210004013 has 32 divisors (see below), whose sum is σ = 208269848246400. Its totient is φ = 83513637810176.
The previous prime is 140230210003903. The next prime is 140230210004033. The reversal of 140230210004013 is 310400012032041.
It is not a de Polignac number, because 140230210004013 - 221 = 140230207906861 is a prime.
It is a super-2 number, since 2×1402302100040132 (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 (140230210004033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 803422956 + ... + 803597477.
It is an arithmetic number, because the mean of its divisors is an integer number (6508432757700).
Almost surely, 2140230210004013 is an apocalyptic number.
It is an amenable number.
140230210004013 is a deficient number, since it is larger than the sum of its proper divisors (68039638242387).
140230210004013 is a wasteful number, since it uses less digits than its factorization.
140230210004013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607020541.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 140230210004013 its reverse (310400012032041), we get a palindrome (450630222036054).
The spelling of 140230210004013 in words is "one hundred forty trillion, two hundred thirty billion, two hundred ten million, four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •