Base | Representation |
---|---|
bin | 1110110000111000110111… |
… | …10000001111100110111100 |
3 | 11020221201201221222212012211 |
4 | 13120130123300033212330 |
5 | 13223411110044002030 |
6 | 153014421534510204 |
7 | 6560412542534542 |
oct | 730343360174674 |
9 | 136851657885184 |
10 | 32466123422140 |
11 | a387895310a51 |
12 | 378419b065364 |
13 | 151670858c335 |
14 | 803523c2bd92 |
15 | 3b47b97ba12a |
hex | 1d871bc0f9bc |
32466123422140 has 48 divisors (see below), whose sum is σ = 70516445448960. Its totient is φ = 12542840893440.
The previous prime is 32466123422123. The next prime is 32466123422267. The reversal of 32466123422140 is 4122432166423.
It is a super-4 number, since 4×324661234221404 (a number of 55 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32466123422093 and 32466123422102.
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, 51123237 + ... + 51754396.
It is an arithmetic number, because the mean of its divisors is an integer number (1469092613520).
Almost surely, 232466123422140 is an apocalyptic number.
It is an amenable number.
32466123422140 is an abundant number, since it is smaller than the sum of its proper divisors (38050322026820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32466123422140 is a wasteful number, since it uses less digits than its factorization.
32466123422140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102878182 (or 102878180 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 40.
Adding to 32466123422140 its reverse (4122432166423), we get a palindrome (36588555588563).
The spelling of 32466123422140 in words is "thirty-two trillion, four hundred sixty-six billion, one hundred twenty-three million, four hundred twenty-two thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •