Base | Representation |
---|---|
bin | 101000011011100011… |
… | …110000101001111010 |
3 | 11011001110101201122120 |
4 | 220123203300221322 |
5 | 1202401440011442 |
6 | 31535422302110 |
7 | 3064535120214 |
oct | 503343605172 |
9 | 134043351576 |
10 | 43412032122 |
11 | 17457a622a8 |
12 | 84b6727936 |
13 | 412ac2bb94 |
14 | 215b7cb5b4 |
15 | 11e13194ec |
hex | a1b8f0a7a |
43412032122 has 8 divisors (see below), whose sum is σ = 86824064256. Its totient is φ = 14470677372.
The previous prime is 43412032057. The next prime is 43412032127. The reversal of 43412032122 is 22123021434.
It is a happy number.
43412032122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
43412032122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 43412032092 and 43412032101.
It is not an unprimeable number, because it can be changed into a prime (43412032127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3617669338 + ... + 3617669349.
It is an arithmetic number, because the mean of its divisors is an integer number (10853008032).
Almost surely, 243412032122 is an apocalyptic number.
43412032122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43412032122 is a wasteful number, since it uses less digits than its factorization.
43412032122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7235338692.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 43412032122 its reverse (22123021434), we get a palindrome (65535053556).
The spelling of 43412032122 in words is "forty-three billion, four hundred twelve million, thirty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •