Base | Representation |
---|---|
bin | 1001101010100101011… |
… | …01001010110001111101 |
3 | 1011202012121211201211020 |
4 | 10311102231022301331 |
5 | 20420120103213031 |
6 | 412321544414353 |
7 | 32664514612122 |
oct | 4652255126175 |
9 | 1152177751736 |
10 | 332100054141 |
11 | 11892a906069 |
12 | 544437773b9 |
13 | 2541730039b |
14 | 1210644c749 |
15 | 898a861096 |
hex | 4d52b4ac7d |
332100054141 has 4 divisors (see below), whose sum is σ = 442800072192. Its totient is φ = 221400036092.
The previous prime is 332100054119. The next prime is 332100054173. The reversal of 332100054141 is 141450001233.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 332100054141 - 211 = 332100052093 is a prime.
It is a super-2 number, since 2×3321000541412 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (332100059141) 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, 55350009021 + ... + 55350009026.
It is an arithmetic number, because the mean of its divisors is an integer number (110700018048).
Almost surely, 2332100054141 is an apocalyptic number.
It is an amenable number.
332100054141 is a deficient number, since it is larger than the sum of its proper divisors (110700018051).
332100054141 is a wasteful number, since it uses less digits than its factorization.
332100054141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110700018050.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 332100054141 its reverse (141450001233), we get a palindrome (473550055374).
The spelling of 332100054141 in words is "three hundred thirty-two billion, one hundred million, fifty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •