Base | Representation |
---|---|
bin | 111101001000100101001… |
… | …100101100011010100010 |
3 | 112212121210000202212120220 |
4 | 331020211030230122202 |
5 | 1022312324114201010 |
6 | 12533543141543510 |
7 | 612343140441045 |
oct | 75104514543242 |
9 | 15777700685526 |
10 | 4201102100130 |
11 | 137a74a681a21 |
12 | 57a250714b96 |
13 | 246215552460 |
14 | 107497948c5c |
15 | 7443107c970 |
hex | 3d22532c6a2 |
4201102100130 has 64 divisors (see below), whose sum is σ = 10858457127168. Its totient is φ = 1034096106240.
The previous prime is 4201102100059. The next prime is 4201102100137. The reversal of 4201102100130 is 310012011024.
It is a super-3 number, since 3×42011021001303 (a number of 39 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (4201102100137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27785035 + ... + 27935825.
It is an arithmetic number, because the mean of its divisors is an integer number (169663392612).
Almost surely, 24201102100130 is an apocalyptic number.
4201102100130 is an abundant number, since it is smaller than the sum of its proper divisors (6657355027038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4201102100130 is a wasteful number, since it uses less digits than its factorization.
4201102100130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222251.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 4201102100130 its reverse (310012011024), we get a palindrome (4511114111154).
The spelling of 4201102100130 in words is "four trillion, two hundred one billion, one hundred two million, one hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •