Base | Representation |
---|---|
bin | 10011101010100000111000… |
… | …00010010011011110000010 |
3 | 12200002220200100022002100120 |
4 | 21311100130002103132002 |
5 | 21131440011440232320 |
6 | 231545105402001110 |
7 | 12052101024515205 |
oct | 1165203402233602 |
9 | 180086610262316 |
10 | 43242201102210 |
11 | 12861a07222720 |
12 | 4a247657a6196 |
13 | 1b189504c5316 |
14 | a96d1010793c |
15 | 4eec67755440 |
hex | 27541c093782 |
43242201102210 has 128 divisors (see below), whose sum is σ = 113912278421760. Its totient is φ = 10418554598400.
The previous prime is 43242201102209. The next prime is 43242201102229. The reversal of 43242201102210 is 1220110224234.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 96120076 + ... + 96568904.
It is an arithmetic number, because the mean of its divisors is an integer number (889939675170).
Almost surely, 243242201102210 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 43242201102210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56956139210880).
43242201102210 is an abundant number, since it is smaller than the sum of its proper divisors (70670077319550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43242201102210 is a wasteful number, since it uses less digits than its factorization.
43242201102210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450644.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 43242201102210 its reverse (1220110224234), we get a palindrome (44462311326444).
The spelling of 43242201102210 in words is "forty-three trillion, two hundred forty-two billion, two hundred one million, one hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •