Base | Representation |
---|---|
bin | 100000001010000000101011… |
… | …010100110101100100110100 |
3 | 200112202010200222122100102110 |
4 | 200022000223110311210310 |
5 | 122014103214430132200 |
6 | 1220441534134211020 |
7 | 41534435333313201 |
oct | 4012005324654464 |
9 | 615663628570373 |
10 | 141425410005300 |
11 | 410761a7aa4613 |
12 | 13a412377b3a70 |
13 | 60bb488786465 |
14 | 26cd0524caca8 |
15 | 1153bed30bb50 |
hex | 80a02b535934 |
141425410005300 has 36 divisors (see below), whose sum is σ = 409190852949536. Its totient is φ = 37713442668000.
The previous prime is 141425410005293. The next prime is 141425410005343. The reversal of 141425410005300 is 3500014524141.
It is a super-2 number, since 2×1414254100053002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 235709016376 + ... + 235709016975.
Almost surely, 2141425410005300 is an apocalyptic number.
141425410005300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
141425410005300 is an abundant number, since it is smaller than the sum of its proper divisors (267765442944236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141425410005300 is a wasteful number, since it uses less digits than its factorization.
141425410005300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 471418033368 (or 471418033361 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 141425410005300 its reverse (3500014524141), we get a palindrome (144925424529441).
The spelling of 141425410005300 in words is "one hundred forty-one trillion, four hundred twenty-five billion, four hundred ten million, five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •