Base | Representation |
---|---|
bin | 101111111000111000011101… |
… | …0110110111100001001000101 |
3 | 2001020110121002122202220100000 |
4 | 1133301300322312330021011 |
5 | 420203000120200100031 |
6 | 4051520153042311513 |
7 | 154504111105622250 |
oct | 13761607266741105 |
9 | 2036417078686300 |
10 | 421234200003141 |
11 | 11224446a392328 |
12 | 3b2b2015358599 |
13 | 151072a368b825 |
14 | 7603bb6172097 |
15 | 33a74053a93e6 |
hex | 17f1c3adbc245 |
421234200003141 has 48 divisors (see below), whose sum is σ = 740615085601664. Its totient is φ = 234199709619264.
The previous prime is 421234200003061. The next prime is 421234200003151. The reversal of 421234200003141 is 141300002432124.
421234200003141 is a `hidden beast` number, since 4 + 2 + 1 + 2 + 342 + 0 + 0 + 0 + 0 + 314 + 1 = 666.
It is not a de Polignac number, because 421234200003141 - 225 = 421234166448709 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421234200003151) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3346412110 + ... + 3346537983.
Almost surely, 2421234200003141 is an apocalyptic number.
It is an amenable number.
421234200003141 is a deficient number, since it is larger than the sum of its proper divisors (319380885598523).
421234200003141 is an equidigital number, since it uses as much as digits as its factorization.
421234200003141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6692950152 (or 6692950140 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 421234200003141 its reverse (141300002432124), we get a palindrome (562534202435265).
The spelling of 421234200003141 in words is "four hundred twenty-one trillion, two hundred thirty-four billion, two hundred million, three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •