Base | Representation |
---|---|
bin | 111011101101001111001… |
… | …011100110110010111000 |
3 | 112112020121200011020020011 |
4 | 323231033023212302320 |
5 | 1014210442141211412 |
6 | 12420522525311304 |
7 | 602301500230141 |
oct | 73551713466270 |
9 | 15466550136204 |
10 | 4103022210232 |
11 | 134209a087a80 |
12 | 563239a05534 |
13 | 239bb4797b4a |
14 | 102831908ac8 |
15 | 71ae06c47a7 |
hex | 3bb4f2e6cb8 |
4103022210232 has 64 divisors (see below), whose sum is σ = 8476128437760. Its totient is φ = 1846472409600.
The previous prime is 4103022210229. The next prime is 4103022210269. The reversal of 4103022210232 is 2320122203014.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8832523 + ... + 9285445.
It is an arithmetic number, because the mean of its divisors is an integer number (132439506840).
Almost surely, 24103022210232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4103022210232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4238064218880).
4103022210232 is an abundant number, since it is smaller than the sum of its proper divisors (4373106227528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4103022210232 is a wasteful number, since it uses less digits than its factorization.
4103022210232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453964 (or 453960 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 4103022210232 its reverse (2320122203014), we get a palindrome (6423144413246).
The spelling of 4103022210232 in words is "four trillion, one hundred three billion, twenty-two million, two hundred ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •