Base | Representation |
---|---|
bin | 110000011100011110100010… |
… | …1001011110111101010100010 |
3 | 2001212210021120101011120120100 |
4 | 1200320331011023313222202 |
5 | 421323123221244342010 |
6 | 4110143423310323230 |
7 | 155520416655240603 |
oct | 14070750513675242 |
9 | 2055707511146510 |
10 | 426126341012130 |
11 | 1138601914574a0 |
12 | 3b9621814b9516 |
13 | 153a07069a1905 |
14 | 77328a6c17daa |
15 | 343e7cd94b2c0 |
hex | 1838f452f7aa2 |
426126341012130 has 48 divisors (see below), whose sum is σ = 1208649258146304. Its totient is φ = 103303355396640.
The previous prime is 426126341012077. The next prime is 426126341012143. The reversal of 426126341012130 is 31210143621624.
426126341012130 is a `hidden beast` number, since 4 + 2 + 6 + 1 + 2 + 634 + 1 + 0 + 1 + 2 + 13 + 0 = 666.
It is a super-2 number, since 2×4261263410121302 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 215215322754 + ... + 215215324733.
It is an arithmetic number, because the mean of its divisors is an integer number (25180192878048).
Almost surely, 2426126341012130 is an apocalyptic number.
426126341012130 is an abundant number, since it is smaller than the sum of its proper divisors (782522917134174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426126341012130 is a wasteful number, since it uses less digits than its factorization.
426126341012130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430430647511 (or 430430647508 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
Adding to 426126341012130 its reverse (31210143621624), we get a palindrome (457336484633754).
The spelling of 426126341012130 in words is "four hundred twenty-six trillion, one hundred twenty-six billion, three hundred forty-one million, twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •