Base | Representation |
---|---|
bin | 110000001010011001010001… |
… | …0000000000101100101000100 |
3 | 2001112222200202111121001122110 |
4 | 1200110302202000011211010 |
5 | 421011413444201440400 |
6 | 4101002012402501020 |
7 | 155143026454335201 |
oct | 14024624200054504 |
9 | 2045880674531573 |
10 | 423641112140100 |
11 | 112a92206558298 |
12 | 3b62059b364770 |
13 | 152502545b2aaa |
14 | 76884a6bccca8 |
15 | 33e9d269e0e50 |
hex | 1814ca2005944 |
423641112140100 has 144 divisors (see below), whose sum is σ = 1320286736240640. Its totient is φ = 104573402102400.
The previous prime is 423641112140087. The next prime is 423641112140149. The reversal of 423641112140100 is 1041211146324.
It is a super-4 number, since 4×4236411121401004 (a number of 60 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 990064530 + ... + 990492329.
It is an arithmetic number, because the mean of its divisors is an integer number (9168657890560).
Almost surely, 2423641112140100 is an apocalyptic number.
It is an amenable number.
423641112140100 is an abundant number, since it is smaller than the sum of its proper divisors (896645624100540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423641112140100 is a wasteful number, since it uses less digits than its factorization.
423641112140100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1980556930 (or 1980556923 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 30.
Adding to 423641112140100 its reverse (1041211146324), we get a palindrome (424682323286424).
The spelling of 423641112140100 in words is "four hundred twenty-three trillion, six hundred forty-one billion, one hundred twelve million, one hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •