Base | Representation |
---|---|
bin | 101000101001011101… |
… | …110110101000000110 |
3 | 11011122201110020211110 |
4 | 220221131312220012 |
5 | 1203341203132432 |
6 | 32014515345450 |
7 | 3103400323230 |
oct | 505135665006 |
9 | 134581406743 |
10 | 43645364742 |
11 | 17567741581 |
12 | 85608b2286 |
13 | 4167387015 |
14 | 21807a9250 |
15 | 1206a59dcc |
hex | a29776a06 |
43645364742 has 64 divisors (see below), whose sum is σ = 104182723584. Its totient is φ = 11918248320.
The previous prime is 43645364729. The next prime is 43645364779. The reversal of 43645364742 is 24746354634.
It is a junction number, because it is equal to n+sod(n) for n = 43645364691 and 43645364700.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1215892 + ... + 1251272.
It is an arithmetic number, because the mean of its divisors is an integer number (1627855056).
Almost surely, 243645364742 is an apocalyptic number.
43645364742 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 43645364742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52091361792).
43645364742 is an abundant number, since it is smaller than the sum of its proper divisors (60537358842).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43645364742 is a wasteful number, since it uses less digits than its factorization.
43645364742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36693.
The product of its digits is 5806080, while the sum is 48.
The spelling of 43645364742 in words is "forty-three billion, six hundred forty-five million, three hundred sixty-four thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •